/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:10,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:11,034 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:11,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:11,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:11,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:11,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:11,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:11,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:11,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:11,059 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:11,060 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:11,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:11,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:11,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:11,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:11,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:11,062 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:11,062 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:11,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:11,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:11,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:11,308 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:11,308 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:11,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl [2025-04-26 16:21:11,310 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl' [2025-04-26 16:21:11,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:11,332 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:11,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:11,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:11,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:11,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,369 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:11,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:11,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:11,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:11,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:11,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:11,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:11,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:11,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:11,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/1) ... [2025-04-26 16:21:11,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:11,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:11,427 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:11,430 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:11,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:21:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:21:11,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:21:11,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:21:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:21:11,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:21:11,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:21:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:21:11,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:21:11,453 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:11,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:11,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:11,453 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:11,490 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:11,492 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:11,591 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:11,592 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:11,599 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:11,600 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:11,600 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:11 BoogieIcfgContainer [2025-04-26 16:21:11,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:11,602 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:11,602 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:11,606 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:11,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:11,607 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:11" (1/2) ... [2025-04-26 16:21:11,608 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3082cea6 and model type map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:11, skipping insertion in model container [2025-04-26 16:21:11,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:11,608 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:11" (2/2) ... [2025-04-26 16:21:11,609 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1.bpl [2025-04-26 16:21:11,660 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:21:11,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 101 flow [2025-04-26 16:21:11,716 INFO L116 PetriNetUnfolderBase]: 5/34 cut-off events. [2025-04-26 16:21:11,718 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:21:11,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-26 16:21:11,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 101 flow [2025-04-26 16:21:11,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2025-04-26 16:21:11,729 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 34 transitions, 86 flow [2025-04-26 16:21:11,737 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:11,737 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:11,737 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:11,737 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:11,737 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:11,737 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:11,737 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:11,737 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:11,739 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:11,845 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 426 [2025-04-26 16:21:11,846 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:11,846 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:11,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:11,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:11,850 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:11,850 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 497 states, but on-demand construction may add more states [2025-04-26 16:21:11,870 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 426 [2025-04-26 16:21:11,872 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:11,872 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:11,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:11,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:11,876 INFO L752 eck$LassoCheckResult]: Stem: "[83] $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[]" "[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 16:21:11,877 INFO L754 eck$LassoCheckResult]: Loop: "[90] L51-1-->L52: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[92] L52-->L53: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork0_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[93] L53-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 16:21:11,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2025-04-26 16:21:11,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:11,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520228853] [2025-04-26 16:21:11,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:11,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:11,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:11,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:11,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:11,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:11,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:11,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:11,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:11,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:11,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:11,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:11,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash 119226, now seen corresponding path program 1 times [2025-04-26 16:21:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:11,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199384244] [2025-04-26 16:21:11,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:11,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:11,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:11,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:11,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:11,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:11,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:11,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:11,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:11,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:11,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:11,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash -923251645, now seen corresponding path program 1 times [2025-04-26 16:21:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:11,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367212130] [2025-04-26 16:21:11,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:11,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:12,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:12,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:12,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:12,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:12,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:12,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:12,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:12,161 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:12,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:12,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:12,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:12,162 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:12,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:12,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:12,162 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:12,162 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:12,162 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:12,162 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:12,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,288 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:12,291 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:12,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:12,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:12,299 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:12,300 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:12,301 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:12,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:12,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:12,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:12,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:12,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:12,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:12,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:12,327 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:12,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:21:12,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:12,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:12,336 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:12,337 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:12,338 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:12,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:12,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:12,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:12,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:12,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:12,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:12,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:12,385 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:21:12,385 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:12,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:12,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:12,388 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:12,390 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:12,391 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:12,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:21:12,409 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:12,409 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:12,410 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2025-04-26 16:21:12,416 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:12,421 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:12,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:12,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:12,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:12,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:12,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:12,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:12,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:12,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:12,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:12,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:12,504 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:12,564 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:12,571 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 497 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:12,696 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 497 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 1272 states and 4753 transitions. Complement of second has 6 states. [2025-04-26 16:21:12,698 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:12,701 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:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-04-26 16:21:12,705 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:21:12,706 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:12,706 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:21:12,706 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:12,706 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:21:12,706 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:12,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1272 states and 4753 transitions. [2025-04-26 16:21:12,726 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 375 [2025-04-26 16:21:12,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1272 states to 994 states and 3732 transitions. [2025-04-26 16:21:12,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 527 [2025-04-26 16:21:12,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 727 [2025-04-26 16:21:12,747 INFO L74 IsDeterministic]: Start isDeterministic. Operand 994 states and 3732 transitions. [2025-04-26 16:21:12,748 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:12,748 INFO L218 hiAutomatonCegarLoop]: Abstraction has 994 states and 3732 transitions. [2025-04-26 16:21:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states and 3732 transitions. [2025-04-26 16:21:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 797. [2025-04-26 16:21:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 797 states have (on average 3.806775407779172) internal successors, (in total 3034), 796 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3034 transitions. [2025-04-26 16:21:12,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 797 states and 3034 transitions. [2025-04-26 16:21:12,811 INFO L438 stractBuchiCegarLoop]: Abstraction has 797 states and 3034 transitions. [2025-04-26 16:21:12,811 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:12,811 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 797 states and 3034 transitions. [2025-04-26 16:21:12,817 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 375 [2025-04-26 16:21:12,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:12,817 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:12,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:12,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:12,818 INFO L752 eck$LassoCheckResult]: Stem: "[83] $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[]" "[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1]" "[120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k]" "[106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" [2025-04-26 16:21:12,818 INFO L754 eck$LassoCheckResult]: Loop: "[108] L83-1-->L84: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[110] L84-->L85: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[111] L85-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" [2025-04-26 16:21:12,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 108793831, now seen corresponding path program 1 times [2025-04-26 16:21:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:12,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598646065] [2025-04-26 16:21:12,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:12,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:12,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:12,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:12,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:12,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:12,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:12,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:12,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 137100, now seen corresponding path program 1 times [2025-04-26 16:21:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:12,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060854655] [2025-04-26 16:21:12,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:12,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:12,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:12,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:12,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:12,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:12,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:12,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:12,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:12,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1623181850, now seen corresponding path program 1 times [2025-04-26 16:21:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:12,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380751064] [2025-04-26 16:21:12,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:12,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:12,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:12,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:12,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:12,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:12,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:12,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:12,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:12,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:12,928 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:12,928 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:12,928 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:12,928 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:12,928 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:12,928 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:12,928 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:12,928 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:12,928 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:12,928 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:12,928 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:12,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:12,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,038 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:13,038 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,042 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:13,043 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:13,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:13,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,062 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:21:13,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,070 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:13,072 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:13,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:13,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:13,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:13,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:13,086 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:13,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,097 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:13,099 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:13,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:13,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:13,136 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:21:13,136 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:21:13,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,138 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:13,140 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:13,141 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:13,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:21:13,156 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:13,156 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:13,156 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2025-04-26 16:21:13,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:21:13,163 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:13,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:13,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:13,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:13,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:13,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:13,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:13,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:13,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:13,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:13,222 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:21:13,223 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 797 states and 3034 transitions. cyclomatic complexity: 2322 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:13,312 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 797 states and 3034 transitions. cyclomatic complexity: 2322. 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 2163 states and 8930 transitions. Complement of second has 6 states. [2025-04-26 16:21:13,312 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:13,313 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:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 16:21:13,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:13,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:13,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:13,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:13,314 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:13,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:13,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2163 states and 8930 transitions. [2025-04-26 16:21:13,338 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 288 [2025-04-26 16:21:13,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2163 states to 1532 states and 6372 transitions. [2025-04-26 16:21:13,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 569 [2025-04-26 16:21:13,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 735 [2025-04-26 16:21:13,381 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1532 states and 6372 transitions. [2025-04-26 16:21:13,382 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:13,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1532 states and 6372 transitions. [2025-04-26 16:21:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states and 6372 transitions. [2025-04-26 16:21:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1258. [2025-04-26 16:21:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1258 states have (on average 4.155007949125596) internal successors, (in total 5227), 1257 states have internal predecessors, (5227), 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:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 5227 transitions. [2025-04-26 16:21:13,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1258 states and 5227 transitions. [2025-04-26 16:21:13,421 INFO L438 stractBuchiCegarLoop]: Abstraction has 1258 states and 5227 transitions. [2025-04-26 16:21:13,421 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:13,422 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1258 states and 5227 transitions. [2025-04-26 16:21:13,430 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 288 [2025-04-26 16:21:13,430 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:13,430 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:13,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:13,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:13,431 INFO L752 eck$LassoCheckResult]: Stem: "[83] $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[]" "[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1]" "[94] $Ultimate##0-->L64: Formula: (= v_thread2Thread1of1ForFork1_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_cnt]" "[95] L64-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 16:21:13,431 INFO L754 eck$LassoCheckResult]: Loop: "[97] L65-1-->L66: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_N_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[100] L66-->L66-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork1_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} AuxVars[] AssignedVars[]" "[103] L66-2-->L69-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork1_j_13) 0) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[105] L69-1-->L65-1: Formula: (= v_thread2Thread1of1ForFork1_j_16 (+ v_thread2Thread1of1ForFork1_j_15 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 16:21:13,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 108793014, now seen corresponding path program 1 times [2025-04-26 16:21:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:13,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54461426] [2025-04-26 16:21:13,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:13,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:13,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:13,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:13,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:13,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:13,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:13,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash 3912646, now seen corresponding path program 1 times [2025-04-26 16:21:13,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:13,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830279742] [2025-04-26 16:21:13,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:13,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:13,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:13,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:13,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:13,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:13,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:13,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:13,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash 466116091, now seen corresponding path program 1 times [2025-04-26 16:21:13,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:13,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652625843] [2025-04-26 16:21:13,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:13,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:13,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:13,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:13,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:13,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:13,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:13,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:13,521 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:13,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:13,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:13,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:13,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:13,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:13,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:13,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:13,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:13,522 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:13,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:13,605 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:13,605 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:13,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,607 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:13,609 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:13,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:13,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,626 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,631 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:13,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,633 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:13,634 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:13,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:13,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:13,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:13,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:13,649 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,655 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:13,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,657 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:13,659 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:13,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:13,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:13,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:13,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:13,672 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:13,678 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:13,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,681 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:13,682 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:13,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:13,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:13,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:13,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:13,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:13,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:13,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:13,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:13,708 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:21:13,708 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:13,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:13,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:13,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:13,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:21:13,711 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:13,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:21:13,727 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:13,727 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:13,727 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2025-04-26 16:21:13,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:21:13,733 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:13,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:13,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:13,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:13,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:13,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:13,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:13,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:13,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:13,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:13,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:13,756 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:13,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:13,777 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:21:13,777 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1258 states and 5227 transitions. cyclomatic complexity: 4066 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:13,868 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1258 states and 5227 transitions. cyclomatic complexity: 4066. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3406 states and 14400 transitions. Complement of second has 6 states. [2025-04-26 16:21:13,869 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:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 16:21:13,871 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:21:13,871 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:13,871 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:21:13,871 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:13,871 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:21:13,871 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:13,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3406 states and 14400 transitions. [2025-04-26 16:21:13,932 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:13,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3406 states to 0 states and 0 transitions. [2025-04-26 16:21:13,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:13,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:13,932 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:13,933 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:13,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:13,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:13,933 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:13,933 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:13,933 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:13,933 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:13,933 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:13,939 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:13 BoogieIcfgContainer [2025-04-26 16:21:13,939 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:13,940 INFO L158 Benchmark]: Toolchain (without parser) took 2611.29ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 86.9MB in the beginning and 113.4MB in the end (delta: -26.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:13,940 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 87.8MB in the end (delta: 199.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:13,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.99ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:13,941 INFO L158 Benchmark]: Boogie Preprocessor took 26.31ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:13,942 INFO L158 Benchmark]: RCFGBuilder took 202.89ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 74.3MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:21:13,943 INFO L158 Benchmark]: BuchiAutomizer took 2337.04ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.3MB in the beginning and 113.4MB in the end (delta: -39.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:13,943 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.71ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 87.8MB in the end (delta: 199.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.99ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.31ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 202.89ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 74.3MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2337.04ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.3MB in the beginning and 113.4MB in the end (delta: -39.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. 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, 471 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, 195 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 134 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital49 mio100 ax100 hnf100 lsp92 ukn65 mio100 lsp93 div100 bol100 ite100 ukn100 eq143 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 75ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.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 -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j 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:13,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...