/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-update2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:14,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:14,213 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:14,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:14,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:14,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:14,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:14,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:14,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:14,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:14,240 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:14,241 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:14,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:14,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:14,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:14,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:14,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:14,243 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:14,243 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:14,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:14,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:14,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:14,481 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:14,481 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:14,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl [2025-04-26 16:21:14,482 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl' [2025-04-26 16:21:14,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:14,508 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:14,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:14,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:14,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:14,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,543 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:14,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:14,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:14,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:14,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:14,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:14,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:14,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:14,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:14,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/1) ... [2025-04-26 16:21:14,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:14,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:14,598 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:14,601 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:14,622 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:21:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:21:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:21:14,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:21:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:21:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:21:14,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:21:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:21:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:21:14,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:14,624 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:14,658 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:14,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:14,762 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:14,762 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:14,808 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:14,809 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:14,809 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:14 BoogieIcfgContainer [2025-04-26 16:21:14,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:14,811 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:14,811 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:14,816 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:14,817 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:14,817 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:14" (1/2) ... [2025-04-26 16:21:14,818 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59a1983e and model type map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:14, skipping insertion in model container [2025-04-26 16:21:14,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:14,818 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:14" (2/2) ... [2025-04-26 16:21:14,819 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update2.bpl [2025-04-26 16:21:14,885 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:21:14,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 16:21:14,938 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-26 16:21:14,940 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:21:14,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 16:21:14,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 16:21:14,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2025-04-26 16:21:14,947 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 29 transitions, 76 flow [2025-04-26 16:21:14,956 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:14,956 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:14,956 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:14,956 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:14,956 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:14,956 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:14,956 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:14,957 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:14,958 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:15,076 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 282 [2025-04-26 16:21:15,076 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:15,076 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:15,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:15,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:15,079 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:15,079 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 353 states, but on-demand construction may add more states [2025-04-26 16:21:15,094 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 282 [2025-04-26 16:21:15,094 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:15,094 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:15,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:15,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:15,098 INFO L752 eck$LassoCheckResult]: Stem: "[89] $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[]" "[119] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[92] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" [2025-04-26 16:21:15,099 INFO L754 eck$LassoCheckResult]: Loop: "[94] L51-1-->L52: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[96] L52-->L53: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[97] L53-->L51-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" [2025-04-26 16:21:15,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash 119101, now seen corresponding path program 1 times [2025-04-26 16:21:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:15,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033261923] [2025-04-26 16:21:15,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:15,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:15,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:15,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:15,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:15,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:15,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:15,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash 123198, now seen corresponding path program 1 times [2025-04-26 16:21:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:15,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613840105] [2025-04-26 16:21:15,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:15,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:15,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:15,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:15,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:15,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:15,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:15,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash -746735998, now seen corresponding path program 1 times [2025-04-26 16:21:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:15,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489216424] [2025-04-26 16:21:15,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:15,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:15,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:15,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:15,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:15,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:15,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:15,357 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:15,358 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:15,358 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:15,358 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:15,358 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:15,359 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:15,359 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:15,359 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:15,359 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:15,359 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:15,360 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:15,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:15,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:15,459 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:15,462 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:15,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:15,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:15,465 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:15,470 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:15,472 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:15,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:15,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:15,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:15,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:15,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:15,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:15,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:15,507 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:15,513 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:15,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:15,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:15,515 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:15,516 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:15,517 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:15,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:15,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:15,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:15,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:15,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:15,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:15,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:15,551 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:21:15,552 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:21:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:15,555 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:15,557 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:15,558 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:15,574 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:15,574 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:15,575 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:15,575 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, thread1Thread1of1ForFork2_i) = 1*N - 1*thread1Thread1of1ForFork2_i Supporting invariants [] [2025-04-26 16:21:15,581 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:15,584 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:15,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:15,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:15,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:15,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:15,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:15,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:15,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:15,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:15,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:15,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:15,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:15,673 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:15,732 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:15,735 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 353 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:15,858 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 353 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 900 states and 3151 transitions. Complement of second has 6 states. [2025-04-26 16:21:15,859 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:15,862 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:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-26 16:21:15,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:21:15,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:15,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:21:15,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:15,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:21:15,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:15,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 900 states and 3151 transitions. [2025-04-26 16:21:15,890 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 231 [2025-04-26 16:21:15,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 900 states to 682 states and 2392 transitions. [2025-04-26 16:21:15,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 362 [2025-04-26 16:21:15,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 499 [2025-04-26 16:21:15,917 INFO L74 IsDeterministic]: Start isDeterministic. Operand 682 states and 2392 transitions. [2025-04-26 16:21:15,918 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:15,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 682 states and 2392 transitions. [2025-04-26 16:21:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states and 2392 transitions. [2025-04-26 16:21:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 548. [2025-04-26 16:21:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 548 states have (on average 3.551094890510949) internal successors, (in total 1946), 547 states have internal predecessors, (1946), 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:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1946 transitions. [2025-04-26 16:21:15,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 548 states and 1946 transitions. [2025-04-26 16:21:15,967 INFO L438 stractBuchiCegarLoop]: Abstraction has 548 states and 1946 transitions. [2025-04-26 16:21:15,967 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:15,967 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 548 states and 1946 transitions. [2025-04-26 16:21:15,971 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 231 [2025-04-26 16:21:15,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:15,971 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:15,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:15,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:15,973 INFO L752 eck$LassoCheckResult]: Stem: "[89] $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[]" "[119] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[113] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_14, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_pos=v_thread2Thread1of1ForFork0_pos_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_j, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_pos]" "[98] $Ultimate##0-->L64: Formula: (= (+ v_thread2Thread1of1ForFork0_pos_1 1) 0) InVars {} OutVars{thread2Thread1of1ForFork0_pos=v_thread2Thread1of1ForFork0_pos_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_pos]" "[99] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork0_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_j]" [2025-04-26 16:21:15,973 INFO L754 eck$LassoCheckResult]: Loop: "[101] L65-1-->L66: Formula: (< v_thread2Thread1of1ForFork0_j_5 v_N_4) InVars {thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[103] L66-->L66-1: Formula: (and (let ((.cse0 (select v_B_9 v_thread2Thread1of1ForFork0_j_7))) (or (and (< 0 .cse0) (= v_thread2Thread1of1ForFork0_pos_4 v_thread2Thread1of1ForFork0_j_7)) (and (<= .cse0 0) (= v_thread2Thread1of1ForFork0_pos_4 v_thread2_pos_26)))) (let ((.cse1 (select v_A_13 v_thread2Thread1of1ForFork0_j_7))) (or (and (= v_thread2_pos_26 v_thread2Thread1of1ForFork0_j_7) (< 0 .cse1)) (and (<= .cse1 0) (= v_thread2Thread1of1ForFork0_pos_3 v_thread2_pos_26))))) InVars {A=v_A_13, thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_7, thread2Thread1of1ForFork0_pos=v_thread2Thread1of1ForFork0_pos_3, B=v_B_9} OutVars{A=v_A_13, thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_7, thread2Thread1of1ForFork0_pos=v_thread2Thread1of1ForFork0_pos_4, B=v_B_9} AuxVars[v_thread2_pos_26] AssignedVars[thread2Thread1of1ForFork0_pos]" "[104] L66-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork0_j_10 (+ v_thread2Thread1of1ForFork0_j_9 1)) InVars {thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_9} OutVars{thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_j]" [2025-04-26 16:21:15,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:15,974 INFO L85 PathProgramCache]: Analyzing trace with hash 114479379, now seen corresponding path program 1 times [2025-04-26 16:21:15,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:15,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478699708] [2025-04-26 16:21:15,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:15,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:15,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:15,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:15,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:15,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:15,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash 130149, now seen corresponding path program 1 times [2025-04-26 16:21:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:15,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219329393] [2025-04-26 16:21:15,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:15,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:15,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:15,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:15,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:15,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:15,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:15,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:15,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:15,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:15,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 251247123, now seen corresponding path program 1 times [2025-04-26 16:21:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:15,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488579848] [2025-04-26 16:21:15,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:15,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:16,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:16,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:16,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:16,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:16,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:16,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:16,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:16,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:16,155 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:16,155 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:16,155 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:16,155 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:16,155 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:16,155 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:16,155 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:16,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:16,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:16,155 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:16,155 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:16,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,364 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:16,365 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:16,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:16,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:16,367 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:16,369 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:16,370 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:16,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:16,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:16,381 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:21:16,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:16,409 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:21:16,409 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:21:16,448 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:16,526 INFO L436 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2025-04-26 16:21:16,527 INFO L437 ModelExtractionUtils]: 26 out of 50 variables were initially zero. Simplification set additionally 21 variables to zero. [2025-04-26 16:21:16,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:16,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:16,529 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:16,530 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:16,531 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:16,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:21:16,549 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:21:16,549 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:16,550 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_j, N) = -1*thread2Thread1of1ForFork0_j + 1*N Supporting invariants [] [2025-04-26 16:21:16,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:16,558 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:16,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:16,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:16,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:16,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:16,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:16,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:16,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:16,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:16,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:16,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:16,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:16,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:16,619 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:16,620 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 548 states and 1946 transitions. cyclomatic complexity: 1483 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:16,713 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 548 states and 1946 transitions. cyclomatic complexity: 1483. 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 1460 states and 5619 transitions. Complement of second has 6 states. [2025-04-26 16:21:16,714 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:16,714 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:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 16:21:16,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:16,715 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:16,715 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:16,715 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:16,715 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:16,715 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:16,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1460 states and 5619 transitions. [2025-04-26 16:21:16,756 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 150 [2025-04-26 16:21:16,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1460 states to 950 states and 3642 transitions. [2025-04-26 16:21:16,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 357 [2025-04-26 16:21:16,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2025-04-26 16:21:16,768 INFO L74 IsDeterministic]: Start isDeterministic. Operand 950 states and 3642 transitions. [2025-04-26 16:21:16,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:16,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 950 states and 3642 transitions. [2025-04-26 16:21:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states and 3642 transitions. [2025-04-26 16:21:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 784. [2025-04-26 16:21:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 784 states have (on average 3.82015306122449) internal successors, (in total 2995), 783 states have internal predecessors, (2995), 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:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 2995 transitions. [2025-04-26 16:21:16,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 784 states and 2995 transitions. [2025-04-26 16:21:16,807 INFO L438 stractBuchiCegarLoop]: Abstraction has 784 states and 2995 transitions. [2025-04-26 16:21:16,807 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:16,807 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 784 states and 2995 transitions. [2025-04-26 16:21:16,812 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 150 [2025-04-26 16:21:16,812 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:16,812 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:16,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:16,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:16,813 INFO L752 eck$LassoCheckResult]: Stem: "[89] $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[]" "[119] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[113] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_j=v_thread2Thread1of1ForFork0_j_14, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_pos=v_thread2Thread1of1ForFork0_pos_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_j, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_pos]" "[116] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[105] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 16:21:16,813 INFO L754 eck$LassoCheckResult]: Loop: "[107] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[109] L86-->L87: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[110] L87-->L85-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 16:21:16,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash 114479943, now seen corresponding path program 1 times [2025-04-26 16:21:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:16,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655156994] [2025-04-26 16:21:16,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:16,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:16,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:16,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:16,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:16,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:16,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:16,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:16,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:16,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 136107, now seen corresponding path program 1 times [2025-04-26 16:21:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:16,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115954400] [2025-04-26 16:21:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:16,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:16,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:16,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:16,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:16,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:16,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:16,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:16,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:16,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 268055205, now seen corresponding path program 1 times [2025-04-26 16:21:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:16,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006527197] [2025-04-26 16:21:16,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:16,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:16,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:16,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:16,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:16,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:16,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:16,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:16,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:16,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:16,932 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:16,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:16,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:16,933 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:16,933 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:16,933 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:16,933 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:16,933 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:16,933 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:16,933 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:16,933 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:16,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:16,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:17,034 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:17,034 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:17,037 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:17,038 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:17,041 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:17,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:17,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:17,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:17,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:17,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:17,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:17,059 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:17,065 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:17,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:17,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:17,069 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:17,072 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:17,073 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:17,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:17,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:17,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:17,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:17,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:17,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:17,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:17,085 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:17,091 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:17,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:17,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:17,093 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:17,095 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:17,097 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:17,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:17,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:17,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:17,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:17,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:17,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:17,113 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:17,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:17,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:17,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:17,121 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:17,123 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:17,124 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:17,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:17,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:17,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:17,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:17,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:17,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:17,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:17,136 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:17,142 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:17,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:17,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:17,145 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:17,145 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:17,149 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:17,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:17,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:17,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:17,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:17,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:17,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:17,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:17,183 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:21:17,183 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:17,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:17,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:17,186 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:17,187 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:17,189 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:17,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:17,206 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:17,206 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:17,206 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork1_k, N) = -1*thread3Thread1of1ForFork1_k + 1*N Supporting invariants [] [2025-04-26 16:21:17,212 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:17,213 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:17,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:17,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:17,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:17,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:17,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:17,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:17,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:17,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:17,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:17,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:17,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:17,240 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:17,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:17,255 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:17,256 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:17,256 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 2995 transitions. cyclomatic complexity: 2309 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:17,328 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 2995 transitions. cyclomatic complexity: 2309. 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 2088 states and 8104 transitions. Complement of second has 6 states. [2025-04-26 16:21:17,329 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:17,330 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:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 16:21:17,330 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:17,330 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:17,330 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:17,330 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:17,330 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:17,330 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:17,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2088 states and 8104 transitions. [2025-04-26 16:21:17,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:17,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2088 states to 0 states and 0 transitions. [2025-04-26 16:21:17,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:17,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:17,352 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:17,352 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:17,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:17,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:17,352 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:17,352 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:17,352 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:17,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:17,352 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:17,359 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:17 BoogieIcfgContainer [2025-04-26 16:21:17,359 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:17,360 INFO L158 Benchmark]: Toolchain (without parser) took 2851.29ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 85.3MB in the beginning and 49.6MB in the end (delta: 35.7MB). Peak memory consumption was 41.3MB. Max. memory is 8.0GB. [2025-04-26 16:21:17,361 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 86.3MB in the end (delta: 105.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:17,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.61ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:17,361 INFO L158 Benchmark]: Boogie Preprocessor took 24.24ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.4MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:17,361 INFO L158 Benchmark]: RCFGBuilder took 237.83ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 70.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:17,362 INFO L158 Benchmark]: BuchiAutomizer took 2548.45ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 70.7MB in the beginning and 49.6MB in the end (delta: 21.2MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. [2025-04-26 16:21:17,364 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.17ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 86.3MB in the end (delta: 105.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.61ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.24ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.4MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 237.83ms. Allocated memory is still 159.4MB. Free memory was 82.3MB in the beginning and 70.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2548.45ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 70.7MB in the beginning and 49.6MB in the end (delta: 21.2MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 300 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 96 mSDtfsCounter, 147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital58 mio100 ax100 hnf100 lsp136 ukn48 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf145 smp85 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 184ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 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 3 terminating modules (0 trivial, 3 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. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:21:17,376 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...