/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:05,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:06,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:21:06,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:06,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:06,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:06,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:06,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:06,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:06,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:06,076 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:06,076 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:06,076 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:06,077 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:06,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:06,078 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:06,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:06,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:06,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:06,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:06,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:06,079 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:06,079 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:06,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:06,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:06,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:06,310 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:06,310 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:06,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl [2025-04-26 16:21:06,312 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl' [2025-04-26 16:21:06,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:06,338 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:06,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:06,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:06,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:06,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,376 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:06,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:06,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:06,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:06,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:06,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:06,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:06,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:06,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:06,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/1) ... [2025-04-26 16:21:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:06,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:06,428 INFO L229 MonitoredProcess]: Starting monitored process 1 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:21:06,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:21:06,451 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:21:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:21:06,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:21:06,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:21:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:21:06,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:21:06,453 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:21:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:21:06,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:21:06,453 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:06,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:06,454 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:21:06,488 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:06,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:06,578 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:06,578 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:06,586 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:06,586 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:06,586 INFO L201 PluginConnector]: Adding new model map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:06 BoogieIcfgContainer [2025-04-26 16:21:06,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:06,588 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:06,588 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:06,591 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:06,592 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:06,592 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:06" (1/2) ... [2025-04-26 16:21:06,593 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ef114b1 and model type map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:06, skipping insertion in model container [2025-04-26 16:21:06,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:06,593 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:06" (2/2) ... [2025-04-26 16:21:06,594 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1-2modifiers.bpl [2025-04-26 16:21:06,646 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:21:06,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 128 flow [2025-04-26 16:21:06,695 INFO L116 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-04-26 16:21:06,696 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:21:06,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 6/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 101 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 16:21:06,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 50 transitions, 128 flow [2025-04-26 16:21:06,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 42 transitions, 108 flow [2025-04-26 16:21:06,704 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 49 places, 42 transitions, 108 flow [2025-04-26 16:21:06,712 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:06,712 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:06,712 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:06,712 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:06,712 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:06,712 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:06,712 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:06,712 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:06,713 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:07,039 INFO L131 ngComponentsAnalysis]: Automaton has 317 accepting balls. 2781 [2025-04-26 16:21:07,039 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:07,039 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:07,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:07,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:07,043 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:07,043 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2993 states, but on-demand construction may add more states [2025-04-26 16:21:07,102 INFO L131 ngComponentsAnalysis]: Automaton has 317 accepting balls. 2781 [2025-04-26 16:21:07,102 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:07,102 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:07,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:07,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:07,107 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" [2025-04-26 16:21:07,108 INFO L754 eck$LassoCheckResult]: Loop: "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" [2025-04-26 16:21:07,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 117427, now seen corresponding path program 1 times [2025-04-26 16:21:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:07,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594861519] [2025-04-26 16:21:07,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:07,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:07,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:07,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:07,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:07,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:07,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:07,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:07,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:07,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:07,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash 123198, now seen corresponding path program 1 times [2025-04-26 16:21:07,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:07,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256175068] [2025-04-26 16:21:07,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:07,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:07,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:07,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:07,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:07,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:07,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:07,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:07,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:07,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:07,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:07,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:07,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash -796606132, now seen corresponding path program 1 times [2025-04-26 16:21:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:07,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601604480] [2025-04-26 16:21:07,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:07,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:07,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:07,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:07,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:07,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:07,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:07,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:07,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:07,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:07,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:07,366 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:07,367 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:07,367 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:07,367 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:07,368 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:07,368 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:07,368 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:07,368 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:07,368 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:07,368 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:07,368 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:07,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:07,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:07,456 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:07,459 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:07,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:07,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:07,462 INFO L229 MonitoredProcess]: Starting monitored process 2 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:21:07,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:21:07,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:07,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:07,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:07,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:07,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:07,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:07,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:07,526 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:07,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:07,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:07,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:07,536 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:21:07,536 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:21:07,541 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:21:07,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:07,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:07,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:07,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:07,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:07,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:07,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:07,563 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:07,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:21:07,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:07,574 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:21:07,576 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:21:07,580 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:21:07,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:07,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:07,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:07,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:07,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:07,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:07,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:07,623 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:07,623 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:07,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:07,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:07,627 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:21:07,629 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:21:07,630 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:07,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:21:07,652 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:07,652 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:07,652 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_i, N) = -1*thread1Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 16:21:07,659 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:21:07,662 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:07,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:07,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:07,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:07,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:07,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:07,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:07,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:07,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:07,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:07,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:07,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:07,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:07,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:07,745 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:21:07,773 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:21:07,775 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2993 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:08,030 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2993 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7704 states and 37345 transitions. Complement of second has 6 states. [2025-04-26 16:21:08,033 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:21:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2025-04-26 16:21:08,044 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:21:08,045 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:08,045 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:21:08,045 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:08,045 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:21:08,045 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:08,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7704 states and 37345 transitions. [2025-04-26 16:21:08,231 INFO L131 ngComponentsAnalysis]: Automaton has 370 accepting balls. 2622 [2025-04-26 16:21:08,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7704 states to 6306 states and 30672 transitions. [2025-04-26 16:21:08,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3347 [2025-04-26 16:21:08,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4615 [2025-04-26 16:21:08,387 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6306 states and 30672 transitions. [2025-04-26 16:21:08,387 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:08,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6306 states and 30672 transitions. [2025-04-26 16:21:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6306 states and 30672 transitions. [2025-04-26 16:21:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6306 to 5041. [2025-04-26 16:21:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5041 states, 5041 states have (on average 4.951795278714541) internal successors, (in total 24962), 5040 states have internal predecessors, (24962), 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:21:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5041 states to 5041 states and 24962 transitions. [2025-04-26 16:21:08,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5041 states and 24962 transitions. [2025-04-26 16:21:08,651 INFO L438 stractBuchiCegarLoop]: Abstraction has 5041 states and 24962 transitions. [2025-04-26 16:21:08,651 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:08,651 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5041 states and 24962 transitions. [2025-04-26 16:21:08,688 INFO L131 ngComponentsAnalysis]: Automaton has 370 accepting balls. 2622 [2025-04-26 16:21:08,688 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:08,688 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:08,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:08,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:08,689 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 16:21:08,689 INFO L754 eck$LassoCheckResult]: Loop: "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 16:21:08,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash 112887002, now seen corresponding path program 1 times [2025-04-26 16:21:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:08,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990835258] [2025-04-26 16:21:08,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:08,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:08,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:08,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:08,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:08,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:08,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:08,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:08,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:08,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:08,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:08,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash 4035782, now seen corresponding path program 1 times [2025-04-26 16:21:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:08,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490046914] [2025-04-26 16:21:08,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:08,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:08,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:08,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:08,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:08,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:08,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:08,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1778910495, now seen corresponding path program 1 times [2025-04-26 16:21:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:08,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543084212] [2025-04-26 16:21:08,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:08,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:08,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:08,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:08,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:08,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:08,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:08,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:08,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:08,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:08,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:08,880 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:08,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:08,880 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:08,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:08,880 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:08,880 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:08,880 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:08,880 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:08,880 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:08,880 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:08,880 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:08,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:08,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:08,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:08,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:08,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:08,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:09,017 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:09,018 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:09,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:09,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:09,021 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:21:09,022 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:21:09,023 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:21:09,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:09,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:09,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:09,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:09,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:09,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:09,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:09,036 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:09,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:09,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:09,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:09,045 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:21:09,048 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:21:09,047 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:21:09,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:09,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:09,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:09,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:09,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:09,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:09,071 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:09,077 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:21:09,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:09,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:09,079 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:21:09,081 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:21:09,082 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:21:09,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:09,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:09,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:09,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:09,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:09,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:09,100 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:09,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:09,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:09,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:09,109 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:21:09,109 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:21:09,112 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:21:09,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:09,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:09,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:09,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:09,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:09,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:09,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:09,147 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:09,148 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:09,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:09,151 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:21:09,151 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:21:09,153 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:09,169 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:21:09,169 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:09,169 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:09,169 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_j, N) = -1*thread2Thread1of1ForFork2_j + 1*N Supporting invariants [] [2025-04-26 16:21:09,175 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:21:09,176 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:09,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:09,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:09,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:09,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:09,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:09,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:09,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:09,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:09,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:09,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:09,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:09,214 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:09,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:09,244 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:21:09,244 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:21:09,245 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5041 states and 24962 transitions. cyclomatic complexity: 20389 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:09,550 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5041 states and 24962 transitions. cyclomatic complexity: 20389. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 13551 states and 71052 transitions. Complement of second has 6 states. [2025-04-26 16:21:09,551 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:21:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-04-26 16:21:09,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:21:09,552 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:09,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:21:09,552 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:09,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:21:09,552 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:09,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13551 states and 71052 transitions. [2025-04-26 16:21:09,727 INFO L131 ngComponentsAnalysis]: Automaton has 558 accepting balls. 2100 [2025-04-26 16:21:09,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13551 states to 11039 states and 57899 transitions. [2025-04-26 16:21:09,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4055 [2025-04-26 16:21:09,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4851 [2025-04-26 16:21:09,950 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11039 states and 57899 transitions. [2025-04-26 16:21:09,950 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:09,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11039 states and 57899 transitions. [2025-04-26 16:21:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11039 states and 57899 transitions. [2025-04-26 16:21:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11039 to 9584. [2025-04-26 16:21:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9584 states, 9584 states have (on average 5.175500834724541) internal successors, (in total 49602), 9583 states have internal predecessors, (49602), 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:21:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9584 states to 9584 states and 49602 transitions. [2025-04-26 16:21:10,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9584 states and 49602 transitions. [2025-04-26 16:21:10,281 INFO L438 stractBuchiCegarLoop]: Abstraction has 9584 states and 49602 transitions. [2025-04-26 16:21:10,281 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:10,281 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9584 states and 49602 transitions. [2025-04-26 16:21:10,486 INFO L131 ngComponentsAnalysis]: Automaton has 558 accepting balls. 2100 [2025-04-26 16:21:10,487 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:10,487 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:10,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:10,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:10,491 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 16:21:10,492 INFO L754 eck$LassoCheckResult]: Loop: "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[115] L87-->L85-1: Formula: (= (+ v_thread3Thread1of1ForFork3_k_9 1) v_thread3Thread1of1ForFork3_k_10) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_9} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 16:21:10,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 112888098, now seen corresponding path program 1 times [2025-04-26 16:21:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:10,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272608432] [2025-04-26 16:21:10,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:10,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:10,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:10,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:10,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:10,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:10,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:10,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:10,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:10,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:10,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:10,511 INFO L85 PathProgramCache]: Analyzing trace with hash 141072, now seen corresponding path program 1 times [2025-04-26 16:21:10,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:10,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074206724] [2025-04-26 16:21:10,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:10,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:10,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:10,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:10,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:10,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:10,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:10,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:10,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:10,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash 90046031, now seen corresponding path program 1 times [2025-04-26 16:21:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:10,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294187964] [2025-04-26 16:21:10,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:10,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:10,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:10,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:10,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:10,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:10,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:10,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:10,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:10,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:10,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:10,608 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:10,608 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:10,608 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:10,608 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:10,608 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:10,608 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:10,608 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:10,608 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:10,608 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:10,608 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:10,608 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:10,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:10,707 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:10,708 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:10,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:10,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:10,710 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:21:10,711 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:21:10,713 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:21:10,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:10,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:10,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:10,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:10,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:10,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:10,728 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:10,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:10,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:10,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:10,736 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:21:10,737 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:21:10,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:10,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:10,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:10,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:10,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:10,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:10,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:10,753 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:10,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:21:10,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:10,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:10,761 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:21:10,763 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:21:10,764 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:21:10,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:10,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:10,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:10,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:10,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:10,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:10,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:10,777 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:10,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:10,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:10,785 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:21:10,785 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:21:10,788 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:21:10,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:10,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:10,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:10,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:10,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:10,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:10,805 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:10,814 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:10,814 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:21:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:10,816 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:21:10,818 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:21:10,819 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:10,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:10,836 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:10,837 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:10,837 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork3_k, N) = -1*thread3Thread1of1ForFork3_k + 1*N Supporting invariants [] [2025-04-26 16:21:10,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:21:10,843 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:10,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:10,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:10,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:10,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:10,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:10,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:10,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:10,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:10,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:10,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:10,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:10,871 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:10,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:10,893 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:21:10,894 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:21:10,894 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9584 states and 49602 transitions. cyclomatic complexity: 40895 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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:21:11,342 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9584 states and 49602 transitions. cyclomatic complexity: 40895. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 29706 states and 162732 transitions. Complement of second has 6 states. [2025-04-26 16:21:11,343 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:21:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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:21:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-04-26 16:21:11,344 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:11,344 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:11,344 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:11,344 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:11,344 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:11,344 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:11,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29706 states and 162732 transitions. [2025-04-26 16:21:11,760 INFO L131 ngComponentsAnalysis]: Automaton has 427 accepting balls. 1281 [2025-04-26 16:21:12,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29706 states to 18960 states and 103801 transitions. [2025-04-26 16:21:12,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4475 [2025-04-26 16:21:12,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5503 [2025-04-26 16:21:12,080 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18960 states and 103801 transitions. [2025-04-26 16:21:12,080 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:12,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18960 states and 103801 transitions. [2025-04-26 16:21:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18960 states and 103801 transitions. [2025-04-26 16:21:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18960 to 15531. [2025-04-26 16:21:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15531 states, 15531 states have (on average 5.500676067220398) internal successors, (in total 85431), 15530 states have internal predecessors, (85431), 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:21:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 85431 transitions. [2025-04-26 16:21:12,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15531 states and 85431 transitions. [2025-04-26 16:21:12,813 INFO L438 stractBuchiCegarLoop]: Abstraction has 15531 states and 85431 transitions. [2025-04-26 16:21:12,813 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:12,813 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15531 states and 85431 transitions. [2025-04-26 16:21:13,026 INFO L131 ngComponentsAnalysis]: Automaton has 427 accepting balls. 1281 [2025-04-26 16:21:13,026 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:13,026 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:13,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:21:13,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:13,027 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:21:13,027 INFO L754 eck$LassoCheckResult]: Loop: "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:21:13,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,027 INFO L85 PathProgramCache]: Analyzing trace with hash -795435708, now seen corresponding path program 1 times [2025-04-26 16:21:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:13,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127070323] [2025-04-26 16:21:13,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:13,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:13,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:13,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:13,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:13,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:13,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:13,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:13,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash 147030, now seen corresponding path program 1 times [2025-04-26 16:21:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:13,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665718400] [2025-04-26 16:21:13,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:13,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:13,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:13,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:13,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:13,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:13,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:13,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1490487757, now seen corresponding path program 1 times [2025-04-26 16:21:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:13,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610414170] [2025-04-26 16:21:13,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:13,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:13,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:13,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:13,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:13,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:13,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:13,169 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:13,169 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:13,169 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:13,169 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:13,169 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:13,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:13,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:13,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:21:13,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:13,169 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:13,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,309 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:13,309 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,312 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:21:13,313 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:21:13,314 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:21:13,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,328 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,334 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:21:13,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,336 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:21:13,338 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:21:13,339 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:21:13,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,354 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:13,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,362 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:21:13,363 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:21:13,364 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:21:13,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,378 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:13,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,386 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:21:13,387 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:21:13,388 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:21:13,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,404 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,411 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:21:13,412 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:21:13,413 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:21:13,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:13,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:13,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:13,425 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:13,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,432 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:21:13,432 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:21:13,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:21:13,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,447 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,452 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:21:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,454 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:21:13,456 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:21:13,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:13,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,471 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,476 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:21:13,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,479 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:21:13,479 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:21:13,482 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:21:13,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:13,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:13,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:13,496 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:21:13,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,504 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:21:13,504 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:21:13,505 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:21:13,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:13,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:13,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:13,516 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:21:13,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,523 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:21:13,523 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:21:13,524 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:21:13,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:13,545 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:13,546 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:13,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,547 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:21:13,548 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:21:13,549 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:13,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:21:13,565 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:13,565 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:13,565 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 16:21:13,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:21:13,571 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:13,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:13,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:13,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:13,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:13,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:13,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:13,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:13,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:13,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:13,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:13,620 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:21:13,620 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15531 states and 85431 transitions. cyclomatic complexity: 70996 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:14,242 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15531 states and 85431 transitions. cyclomatic complexity: 70996. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 42152 states and 236012 transitions. Complement of second has 6 states. [2025-04-26 16:21:14,242 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:21:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:14,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-04-26 16:21:14,243 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:21:14,243 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:14,243 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:21:14,243 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:14,243 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:21:14,243 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:14,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42152 states and 236012 transitions. [2025-04-26 16:21:15,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:15,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42152 states to 0 states and 0 transitions. [2025-04-26 16:21:15,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:15,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:15,008 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:15,008 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:15,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:15,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:15,008 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:15,008 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:21:15,008 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:15,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:15,008 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:15,015 INFO L201 PluginConnector]: Adding new model map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:15 BoogieIcfgContainer [2025-04-26 16:21:15,015 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:15,015 INFO L158 Benchmark]: Toolchain (without parser) took 8677.94ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 86.2MB in the beginning and 631.2MB in the end (delta: -545.0MB). Peak memory consumption was 471.6MB. Max. memory is 8.0GB. [2025-04-26 16:21:15,015 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:15,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.45ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:15,016 INFO L158 Benchmark]: Boogie Preprocessor took 20.93ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 955.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:15,016 INFO L158 Benchmark]: RCFGBuilder took 186.62ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:15,016 INFO L158 Benchmark]: BuchiAutomizer took 8427.32ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 73.6MB in the beginning and 631.2MB in the end (delta: -557.6MB). Peak memory consumption was 459.0MB. Max. memory is 8.0GB. [2025-04-26 16:21:15,017 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 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.45ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.93ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 955.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 186.62ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 8427.32ms. Allocated memory was 159.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 73.6MB in the beginning and 631.2MB in the end (delta: -557.6MB). Peak memory consumption was 459.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 1.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 6149 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 2.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 356 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 451 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 239 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital51 mio100 ax100 hnf100 lsp81 ukn68 mio100 lsp94 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 66ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 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 N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:21:15,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...