/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/weaver-benchmarks/generated/array-eq-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:50,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:50,777 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:50,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:50,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:50,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:50,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:50,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:50,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:50,797 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:50,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:50,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:50,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:50,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:50,798 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:50,798 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:51,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:51,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:51,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:51,044 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:51,045 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:51,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-symm.wvr.bpl [2025-04-26 16:21:51,046 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-symm.wvr.bpl' [2025-04-26 16:21:51,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:51,066 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:51,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:51,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:51,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:51,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,097 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:51,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:51,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:51,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:51,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:51,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,110 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:51,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:51,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:51,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:51,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,154 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:51,157 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:51,176 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:21:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:21:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:21:51,176 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:21:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:21:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:21:51,176 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:51,177 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:51,211 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:51,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:51,305 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:51,305 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:51,316 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:51,316 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:51,317 INFO L201 PluginConnector]: Adding new model array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:51 BoogieIcfgContainer [2025-04-26 16:21:51,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:51,318 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:51,318 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:51,324 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:51,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:51,325 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/2) ... [2025-04-26 16:21:51,326 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a8687ea and model type array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:51, skipping insertion in model container [2025-04-26 16:21:51,326 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:51,327 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:51" (2/2) ... [2025-04-26 16:21:51,328 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-eq-symm.wvr.bpl [2025-04-26 16:21:51,368 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:51,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 27 transitions, 68 flow [2025-04-26 16:21:51,433 INFO L116 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-04-26 16:21:51,435 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:51,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 4/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 17. Up to 3 conditions per place. [2025-04-26 16:21:51,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 27 transitions, 68 flow [2025-04-26 16:21:51,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 23 transitions, 58 flow [2025-04-26 16:21:51,446 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 23 transitions, 58 flow [2025-04-26 16:21:51,457 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:51,457 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:51,458 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:51,458 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:51,458 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:51,458 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:51,458 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:51,458 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:51,459 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:51,492 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 40 [2025-04-26 16:21:51,493 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:51,493 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:51,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:21:51,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:51,496 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:51,497 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 54 states, but on-demand construction may add more states [2025-04-26 16:21:51,501 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 40 [2025-04-26 16:21:51,503 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:51,503 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:51,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:21:51,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:51,508 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:21:51,509 INFO L754 eck$LassoCheckResult]: Loop: "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[63] L22-->L23: Formula: (= (select v_B_1 v_i_AB_2) (select v_A_1 v_i_AB_2)) InVars {A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} OutVars{A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} AuxVars[] AssignedVars[]" "[65] L23-->L22-2: Formula: (= v_i_AB_3 (+ v_i_AB_4 1)) InVars {i_AB=v_i_AB_4} OutVars{i_AB=v_i_AB_3} AuxVars[] AssignedVars[i_AB]" [2025-04-26 16:21:51,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2525, now seen corresponding path program 1 times [2025-04-26 16:21:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201109944] [2025-04-26 16:21:51,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:51,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:51,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:51,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:51,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,595 INFO L85 PathProgramCache]: Analyzing trace with hash 90430, now seen corresponding path program 1 times [2025-04-26 16:21:51,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431634338] [2025-04-26 16:21:51,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:51,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:51,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:51,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:51,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 75282914, now seen corresponding path program 1 times [2025-04-26 16:21:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612433359] [2025-04-26 16:21:51,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,778 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:51,779 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:51,779 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:51,780 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:51,780 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:51,780 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,780 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:51,780 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:51,780 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:51,780 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:51,781 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:51,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,914 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:51,917 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:51,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,922 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:51,923 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:51,924 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:51,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,952 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,959 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:51,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,961 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:51,963 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:51,964 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:51,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,980 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,986 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:51,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,989 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:51,991 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:51,992 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:52,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,014 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:52,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,017 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:52,018 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:52,020 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:52,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,057 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,063 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:52,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,065 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:52,066 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:52,068 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:52,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:52,108 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:52,109 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:52,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,113 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:52,114 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:52,114 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:52,132 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:52,132 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:52,132 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:52,134 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_AB, An) = -1*i_AB + 1*An Supporting invariants [] [2025-04-26 16:21:52,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:21:52,142 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:52,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:52,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:52,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,224 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:52,264 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:52,287 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 54 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:52,379 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 54 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 191 states and 444 transitions. Complement of second has 7 states. [2025-04-26 16:21:52,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2025-04-26 16:21:52,390 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:21:52,390 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,390 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:52,391 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,391 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:21:52,391 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 444 transitions. [2025-04-26 16:21:52,398 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 53 [2025-04-26 16:21:52,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 121 states and 298 transitions. [2025-04-26 16:21:52,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 16:21:52,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-04-26 16:21:52,409 INFO L74 IsDeterministic]: Start isDeterministic. Operand 121 states and 298 transitions. [2025-04-26 16:21:52,409 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:52,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 298 transitions. [2025-04-26 16:21:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 298 transitions. [2025-04-26 16:21:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 78. [2025-04-26 16:21:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 2.5128205128205128) internal successors, (in total 196), 77 states have internal predecessors, (196), 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:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 196 transitions. [2025-04-26 16:21:52,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 196 transitions. [2025-04-26 16:21:52,430 INFO L438 stractBuchiCegarLoop]: Abstraction has 78 states and 196 transitions. [2025-04-26 16:21:52,430 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:52,430 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 196 transitions. [2025-04-26 16:21:52,434 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 37 [2025-04-26 16:21:52,434 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:52,434 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:52,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:52,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:52,435 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:52,435 INFO L754 eck$LassoCheckResult]: Loop: "[64] L22-->L27: Formula: (not (= (select v_A_2 v_i_AB_5) (select v_B_2 v_i_AB_5))) InVars {A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} OutVars{A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} AuxVars[] AssignedVars[]" "[66] L27-->L22-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:52,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash 78336, now seen corresponding path program 1 times [2025-04-26 16:21:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376357223] [2025-04-26 16:21:52,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash 93402, now seen corresponding path program 1 times [2025-04-26 16:21:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552499064] [2025-04-26 16:21:52,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,479 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:52,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:21:52,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552499064] [2025-04-26 16:21:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552499064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:21:52,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:21:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:21:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150557720] [2025-04-26 16:21:52,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:21:52,484 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:21:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:21:52,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:21:52,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:21:52,486 INFO L87 Difference]: Start difference. First operand 78 states and 196 transitions. cyclomatic complexity: 130 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (in total 3), 3 states have internal predecessors, (3), 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:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:21:52,506 INFO L93 Difference]: Finished difference Result 104 states and 238 transitions. [2025-04-26 16:21:52,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 238 transitions. [2025-04-26 16:21:52,507 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 44 [2025-04-26 16:21:52,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 74 states and 174 transitions. [2025-04-26 16:21:52,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 16:21:52,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 16:21:52,509 INFO L74 IsDeterministic]: Start isDeterministic. Operand 74 states and 174 transitions. [2025-04-26 16:21:52,509 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:52,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 174 transitions. [2025-04-26 16:21:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 174 transitions. [2025-04-26 16:21:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2025-04-26 16:21:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.466666666666667) internal successors, (in total 148), 59 states have internal predecessors, (148), 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:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 148 transitions. [2025-04-26 16:21:52,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 148 transitions. [2025-04-26 16:21:52,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:21:52,514 INFO L438 stractBuchiCegarLoop]: Abstraction has 60 states and 148 transitions. [2025-04-26 16:21:52,514 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:52,515 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 148 transitions. [2025-04-26 16:21:52,515 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:21:52,515 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:52,515 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:52,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:52,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:52,516 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[79] L52-1-->L37-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:21:52,516 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[70] L37-->L38: Formula: (= (select v_B_3 v_i_BA_2) (select v_A_3 v_i_BA_2)) InVars {A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} OutVars{A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} AuxVars[] AssignedVars[]" "[72] L38-->L37-2: Formula: (= (+ v_i_BA_4 1) v_i_BA_3) InVars {i_BA=v_i_BA_4} OutVars{i_BA=v_i_BA_3} AuxVars[] AssignedVars[i_BA]" [2025-04-26 16:21:52,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash 78354, now seen corresponding path program 1 times [2025-04-26 16:21:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526308624] [2025-04-26 16:21:52,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash 97381, now seen corresponding path program 1 times [2025-04-26 16:21:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332611341] [2025-04-26 16:21:52,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1960655692, now seen corresponding path program 1 times [2025-04-26 16:21:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716699128] [2025-04-26 16:21:52,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:52,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:52,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:52,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:52,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,646 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:52,646 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:52,647 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:52,647 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:52,647 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:52,647 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,647 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:52,647 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:52,647 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:52,647 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:52,647 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:52,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,733 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:52,733 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:52,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,735 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:52,737 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:52,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,754 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,763 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:52,764 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:52,766 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:52,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,781 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,787 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:52,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,790 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:52,791 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:52,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,806 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:21:52,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,814 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:52,814 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:52,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:52,840 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:52,840 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,847 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:52,849 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:52,852 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:52,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,869 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:52,869 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:52,869 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(An, i_BA) = 1*An - 1*i_BA Supporting invariants [] [2025-04-26 16:21:52,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:21:52,876 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:52,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,939 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:52,940 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:52,940 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 148 transitions. cyclomatic complexity: 98 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:52,991 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 148 transitions. cyclomatic complexity: 98. 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 175 states and 451 transitions. Complement of second has 6 states. [2025-04-26 16:21:52,991 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:52,992 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:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 16:21:52,992 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:21:52,992 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,992 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:21:52,992 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,992 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:21:52,992 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 451 transitions. [2025-04-26 16:21:52,994 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-04-26 16:21:52,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 163 states and 416 transitions. [2025-04-26 16:21:52,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-04-26 16:21:52,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2025-04-26 16:21:52,996 INFO L74 IsDeterministic]: Start isDeterministic. Operand 163 states and 416 transitions. [2025-04-26 16:21:52,996 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:52,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 416 transitions. [2025-04-26 16:21:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 416 transitions. [2025-04-26 16:21:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2025-04-26 16:21:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 2.6825396825396823) internal successors, (in total 338), 125 states have internal predecessors, (338), 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:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 338 transitions. [2025-04-26 16:21:53,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 338 transitions. [2025-04-26 16:21:53,005 INFO L438 stractBuchiCegarLoop]: Abstraction has 126 states and 338 transitions. [2025-04-26 16:21:53,005 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:53,005 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 338 transitions. [2025-04-26 16:21:53,007 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-04-26 16:21:53,007 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:53,007 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:53,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:53,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:53,007 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[79] L52-1-->L37-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:53,008 INFO L754 eck$LassoCheckResult]: Loop: "[71] L37-->L42: Formula: (not (= (select v_A_4 v_i_BA_5) (select v_B_4 v_i_BA_5))) InVars {A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} OutVars{A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} AuxVars[] AssignedVars[]" "[73] L42-->L37-2: Formula: v_break_BA_2 InVars {} OutVars{break_BA=v_break_BA_2} AuxVars[] AssignedVars[break_BA]" "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:53,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2429042, now seen corresponding path program 1 times [2025-04-26 16:21:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370504822] [2025-04-26 16:21:53,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:53,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:53,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:53,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:53,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:53,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,020 INFO L85 PathProgramCache]: Analyzing trace with hash 100353, now seen corresponding path program 1 times [2025-04-26 16:21:53,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453876270] [2025-04-26 16:21:53,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,035 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:53,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:21:53,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453876270] [2025-04-26 16:21:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453876270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:21:53,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:21:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:21:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180907685] [2025-04-26 16:21:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:21:53,036 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:21:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:21:53,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:21:53,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:21:53,037 INFO L87 Difference]: Start difference. First operand 126 states and 338 transitions. cyclomatic complexity: 231 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (in total 3), 3 states have internal predecessors, (3), 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:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:21:53,046 INFO L93 Difference]: Finished difference Result 148 states and 358 transitions. [2025-04-26 16:21:53,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 358 transitions. [2025-04-26 16:21:53,048 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:53,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-04-26 16:21:53,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:53,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:53,048 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:53,048 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:53,048 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:53,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:53,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:21:53,049 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:53,049 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:21:53,049 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:53,049 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:53,049 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:53,054 INFO L201 PluginConnector]: Adding new model array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:53 BoogieIcfgContainer [2025-04-26 16:21:53,054 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:53,055 INFO L158 Benchmark]: Toolchain (without parser) took 1988.72ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 85.9MB in the beginning and 38.4MB in the end (delta: 47.5MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:53,055 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:53,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:53,055 INFO L158 Benchmark]: Boogie Preprocessor took 27.71ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:53,056 INFO L158 Benchmark]: RCFGBuilder took 190.39ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 73.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:53,056 INFO L158 Benchmark]: BuchiAutomizer took 1736.69ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 73.6MB in the beginning and 38.4MB in the end (delta: 35.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:53,057 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.71ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 190.39ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 73.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1736.69ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 73.6MB in the beginning and 38.4MB in the end (delta: 35.2MB). 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 1.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 94 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 78 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital42 mio100 ax100 hnf100 lsp62 ukn84 mio100 lsp86 div100 bol100 ite100 ukn100 eq152 hnf96 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_AB + An and consists of 5 locations. One deterministic module has affine ranking function An + -1 * i_BA and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 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:53,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...