/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 /storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:27,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:27,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:45:27,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:27,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:27,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:27,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:27,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:27,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:27,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:27,213 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:27,213 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:27,213 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:27,213 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:27,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:27,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:27,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:27,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:27,215 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:27,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:27,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:27,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:27,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:27,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:27,216 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:27,216 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:27,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:27,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:27,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:27,418 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:27,419 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:27,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl [2025-02-17 22:45:27,421 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl' [2025-02-17 22:45:27,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:27,432 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:27,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:27,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:27,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:27,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,447 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:27,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:27,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:27,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:27,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:27,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:27,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:27,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:27,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:27,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,485 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-02-17 22:45:27,488 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-02-17 22:45:27,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:27,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:27,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:27,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:27,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:27,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:27,510 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:45:27,549 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:27,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:27,611 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:27,611 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:27,619 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:27,620 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:27,620 INFO L201 PluginConnector]: Adding new model c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:27 BoogieIcfgContainer [2025-02-17 22:45:27,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:27,621 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:27,621 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:27,627 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:27,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:27,628 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/2) ... [2025-02-17 22:45:27,631 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5069289f and model type c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:27, skipping insertion in model container [2025-02-17 22:45:27,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:27,631 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:27" (2/2) ... [2025-02-17 22:45:27,634 INFO L363 chiAutomizerObserver]: Analyzing ICFG c2-barrier-2t.c.bpl [2025-02-17 22:45:27,704 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:45:27,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 76 flow [2025-02-17 22:45:27,757 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-02-17 22:45:27,758 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:45:27,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-02-17 22:45:27,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 76 flow [2025-02-17 22:45:27,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 66 flow [2025-02-17 22:45:27,775 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:27,775 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:27,775 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:27,775 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:27,775 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:27,776 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:27,776 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:27,776 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:27,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:27,815 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 85 [2025-02-17 22:45:27,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:27,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:27,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:27,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:27,819 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:27,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 112 states, but on-demand construction may add more states [2025-02-17 22:45:27,824 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 85 [2025-02-17 22:45:27,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:27,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:27,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:27,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:27,829 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:45:27,829 INFO L754 eck$LassoCheckResult]: Loop: "[69] L22-->L24: Formula: (< (+ v_x4_1 v_x1_1) v_z_2) InVars {x4=v_x4_1, x1=v_x1_1, z=v_z_2} OutVars{x4=v_x4_1, x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[73] L25-->L22: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:45:27,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash 3036, now seen corresponding path program 1 times [2025-02-17 22:45:27,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582803859] [2025-02-17 22:45:27,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:27,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:27,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:27,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:27,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:27,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash 98374, now seen corresponding path program 1 times [2025-02-17 22:45:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270753002] [2025-02-17 22:45:27,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:27,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash 90514059, now seen corresponding path program 1 times [2025-02-17 22:45:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691533361] [2025-02-17 22:45:27,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:27,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:27,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:27,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:27,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,015 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,016 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:28,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:28,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,017 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,084 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,085 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:28,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,089 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-02-17 22:45:28,091 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-02-17 22:45:28,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:28,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:28,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,118 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-02-17 22:45:28,120 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-02-17 22:45:28,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:28,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,212 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:28,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:28,216 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:28,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:28,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,217 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,265 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,268 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:28,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,312 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-02-17 22:45:28,313 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-02-17 22:45:28,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:28,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:28,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:28,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:28,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:28,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:28,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:28,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:28,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:28,340 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:28,340 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:28,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,347 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-02-17 22:45:28,348 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-02-17 22:45:28,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:28,348 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:28,349 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:28,349 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1, x4) = 1*z - 1*x1 - 1*x4 Supporting invariants [] [2025-02-17 22:45:28,354 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-02-17 22:45:28,361 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:28,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:28,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:28,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:28,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:28,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:28,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:28,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:28,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:28,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:28,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:28,525 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:45:28,527 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 112 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,689 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 112 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 264 states and 593 transitions. Complement of second has 6 states. [2025-02-17 22:45:28,695 INFO L141 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-02-17 22:45:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-02-17 22:45:28,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-17 22:45:28,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:45:28,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-17 22:45:28,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 593 transitions. [2025-02-17 22:45:28,735 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 70 [2025-02-17 22:45:28,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 169 states and 382 transitions. [2025-02-17 22:45:28,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2025-02-17 22:45:28,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2025-02-17 22:45:28,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 382 transitions. [2025-02-17 22:45:28,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:28,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 382 transitions. [2025-02-17 22:45:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 382 transitions. [2025-02-17 22:45:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2025-02-17 22:45:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 2.272108843537415) internal successors, (334), 146 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 334 transitions. [2025-02-17 22:45:28,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 334 transitions. [2025-02-17 22:45:28,774 INFO L432 stractBuchiCegarLoop]: Abstraction has 147 states and 334 transitions. [2025-02-17 22:45:28,774 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:28,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 334 transitions. [2025-02-17 22:45:28,776 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 70 [2025-02-17 22:45:28,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:28,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:28,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:28,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:28,777 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L13-1-->L39: 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-02-17 22:45:28,777 INFO L754 eck$LassoCheckResult]: Loop: "[80] L39-->L41: Formula: (< (+ v_x5_5 v_x3_5) v_z_6) InVars {x5=v_x5_5, x3=v_x3_5, z=v_z_6} OutVars{x5=v_x5_5, x3=v_x3_5, z=v_z_6} AuxVars[] AssignedVars[]" "[82] L41-->L42: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[84] L42-->L39: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-02-17 22:45:28,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash 94210, now seen corresponding path program 1 times [2025-02-17 22:45:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620091036] [2025-02-17 22:45:28,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:28,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:28,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 109297, now seen corresponding path program 1 times [2025-02-17 22:45:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615731532] [2025-02-17 22:45:28,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:28,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:28,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1488277680, now seen corresponding path program 1 times [2025-02-17 22:45:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096182196] [2025-02-17 22:45:28,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:28,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:28,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:28,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:28,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,839 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,839 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,839 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,839 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,839 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:28,839 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,839 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,839 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,839 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:28,839 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,839 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,868 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,868 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:28,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,870 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-02-17 22:45:28,871 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-02-17 22:45:28,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:28,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:28,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,892 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-02-17 22:45:28,895 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-02-17 22:45:28,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:28,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,985 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:28,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:28,990 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:28,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:28,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,990 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,018 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,018 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:29,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,021 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-02-17 22:45:29,021 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-02-17 22:45:29,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:29,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:29,038 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:29,038 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:29,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,040 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-02-17 22:45:29,041 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-02-17 22:45:29,041 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:29,041 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:29,041 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:29,042 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-02-17 22:45:29,046 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-02-17 22:45:29,048 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:29,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:29,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,070 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:29,103 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:45:29,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 334 transitions. cyclomatic complexity: 217 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,195 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 334 transitions. cyclomatic complexity: 217. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 443 states and 1047 transitions. Complement of second has 7 states. [2025-02-17 22:45:29,195 INFO L141 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-02-17 22:45:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-02-17 22:45:29,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:45:29,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:45:29,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:45:29,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 1047 transitions. [2025-02-17 22:45:29,201 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 27 [2025-02-17 22:45:29,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 286 states and 693 transitions. [2025-02-17 22:45:29,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2025-02-17 22:45:29,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2025-02-17 22:45:29,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 693 transitions. [2025-02-17 22:45:29,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:29,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286 states and 693 transitions. [2025-02-17 22:45:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 693 transitions. [2025-02-17 22:45:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 254. [2025-02-17 22:45:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 2.468503937007874) internal successors, (627), 253 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 627 transitions. [2025-02-17 22:45:29,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 627 transitions. [2025-02-17 22:45:29,215 INFO L432 stractBuchiCegarLoop]: Abstraction has 254 states and 627 transitions. [2025-02-17 22:45:29,215 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:29,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 627 transitions. [2025-02-17 22:45:29,217 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 27 [2025-02-17 22:45:29,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:29,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:29,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:29,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:29,217 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[70] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[72] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-02-17 22:45:29,217 INFO L754 eck$LassoCheckResult]: Loop: "[75] L29-1-->L31: Formula: (< (+ v_x5_2 v_x3_2) v_z_4) InVars {x5=v_x5_2, x3=v_x3_2, z=v_z_4} OutVars{x5=v_x5_2, x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[77] L31-->L32: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" "[78] L32-->L29-1: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-02-17 22:45:29,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 90513066, now seen corresponding path program 1 times [2025-02-17 22:45:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309386846] [2025-02-17 22:45:29,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:29,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:29,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:29,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:29,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309386846] [2025-02-17 22:45:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309386846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:29,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:45:29,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147537246] [2025-02-17 22:45:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:29,257 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:45:29,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash 104331, now seen corresponding path program 1 times [2025-02-17 22:45:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665652043] [2025-02-17 22:45:29,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:29,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:29,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,287 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,287 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,287 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,287 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,287 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:29,287 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,287 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,287 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,287 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:29,287 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,287 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,313 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,313 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:29,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,317 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-02-17 22:45:29,319 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-02-17 22:45:29,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,336 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-02-17 22:45:29,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,338 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-02-17 22:45:29,339 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-02-17 22:45:29,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:29,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,421 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:29,425 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-02-17 22:45:29,425 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:29,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:29,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,425 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,447 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,447 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:29,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,449 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-02-17 22:45:29,451 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-02-17 22:45:29,452 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-02-17 22:45:29,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,467 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:29,470 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:29,470 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:29,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,489 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:29,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:45:29,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:29,491 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:29,491 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:29,491 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-02-17 22:45:29,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:45:29,497 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:29,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:29,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:29,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:29,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:29,549 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:45:29,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 254 states and 627 transitions. cyclomatic complexity: 413 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 254 states and 627 transitions. cyclomatic complexity: 413. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 544 states and 1407 transitions. Complement of second has 7 states. [2025-02-17 22:45:29,603 INFO L141 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-02-17 22:45:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-02-17 22:45:29,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:45:29,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:45:29,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:45:29,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 544 states and 1407 transitions. [2025-02-17 22:45:29,609 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-02-17 22:45:29,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 544 states to 364 states and 881 transitions. [2025-02-17 22:45:29,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2025-02-17 22:45:29,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2025-02-17 22:45:29,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 364 states and 881 transitions. [2025-02-17 22:45:29,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:29,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 364 states and 881 transitions. [2025-02-17 22:45:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states and 881 transitions. [2025-02-17 22:45:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 255. [2025-02-17 22:45:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 255 states have (on average 2.4352941176470586) internal successors, (621), 254 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 621 transitions. [2025-02-17 22:45:29,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 621 transitions. [2025-02-17 22:45:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:29,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:45:29,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:45:29,631 INFO L87 Difference]: Start difference. First operand 255 states and 621 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:29,651 INFO L93 Difference]: Finished difference Result 133 states and 307 transitions. [2025-02-17 22:45:29,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 307 transitions. [2025-02-17 22:45:29,652 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:45:29,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 307 transitions. [2025-02-17 22:45:29,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-02-17 22:45:29,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-02-17 22:45:29,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 307 transitions. [2025-02-17 22:45:29,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:29,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 133 states and 307 transitions. [2025-02-17 22:45:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 307 transitions. [2025-02-17 22:45:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-17 22:45:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 2.308270676691729) internal successors, (307), 132 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 307 transitions. [2025-02-17 22:45:29,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 307 transitions. [2025-02-17 22:45:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:45:29,658 INFO L432 stractBuchiCegarLoop]: Abstraction has 133 states and 307 transitions. [2025-02-17 22:45:29,658 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:29,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 307 transitions. [2025-02-17 22:45:29,659 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:45:29,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:29,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:29,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:29,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:29,659 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[70] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[94] L13-1-->L39: 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]" "[79] L39-->L44: Formula: (<= v_z_7 (+ v_x5_8 v_x3_8)) InVars {x5=v_x5_8, x3=v_x3_8, z=v_z_7} OutVars{x5=v_x5_8, x3=v_x3_8, z=v_z_7} AuxVars[] AssignedVars[]" "[81] L44-->L45: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[83] L45-->L46-1: Formula: (<= 2 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-02-17 22:45:29,659 INFO L754 eck$LassoCheckResult]: Loop: "[86] L46-1-->L48: Formula: (< v_x1_6 v_z_8) InVars {x1=v_x1_6, z=v_z_8} OutVars{x1=v_x1_6, z=v_z_8} AuxVars[] AssignedVars[]" "[88] L48-->L46-1: Formula: (= v_x1_7 (+ v_x1_8 1)) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-02-17 22:45:29,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash -763978767, now seen corresponding path program 1 times [2025-02-17 22:45:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70580795] [2025-02-17 22:45:29,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:29,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:29,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:29,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:29,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 1 times [2025-02-17 22:45:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229052135] [2025-02-17 22:45:29,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:29,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:29,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:29,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:29,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash 255815283, now seen corresponding path program 1 times [2025-02-17 22:45:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050926824] [2025-02-17 22:45:29,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:29,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:29,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:29,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:29,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,701 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,702 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,702 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,702 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,702 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:29,702 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,702 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:29,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,702 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,717 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,717 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,720 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:29,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:45:29,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:45:29,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,740 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:29,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:45:29,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:29,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,807 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:29,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:29,811 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,811 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,811 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,811 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,812 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:29,812 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,812 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,812 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,812 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:29,812 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,812 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,829 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,829 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:29,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,831 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:29,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:45:29,832 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-02-17 22:45:29,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:29,848 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:29,848 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:29,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,850 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:29,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:45:29,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:29,852 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:29,852 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:29,852 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:45:29,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-17 22:45:29,857 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:29,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:29,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:29,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:29,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:29,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,888 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:29,901 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-02-17 22:45:29,901 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 307 transitions. cyclomatic complexity: 196 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:29,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:45:29,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:45:29,952 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 307 transitions. cyclomatic complexity: 196. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 181 states and 418 transitions. Complement of second has 6 states. [2025-02-17 22:45:29,953 INFO L141 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-02-17 22:45:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-02-17 22:45:29,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:45:29,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:45:29,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:45:29,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 418 transitions. [2025-02-17 22:45:29,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:29,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 0 states and 0 transitions. [2025-02-17 22:45:29,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:29,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:29,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:29,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:29,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:29,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:29,956 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:29,956 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:45:29,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:29,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:29,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:29,964 INFO L201 PluginConnector]: Adding new model c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:29 BoogieIcfgContainer [2025-02-17 22:45:29,964 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:29,965 INFO L158 Benchmark]: Toolchain (without parser) took 2532.59ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 95.9MB in the beginning and 95.6MB in the end (delta: 355.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:29,965 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.80ms. Allocated memory is still 167.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:29,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.95ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 94.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:29,965 INFO L158 Benchmark]: Boogie Preprocessor took 9.26ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 94.0MB in the end (delta: 641.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:29,966 INFO L158 Benchmark]: RCFGBuilder took 161.65ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 84.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:45:29,966 INFO L158 Benchmark]: BuchiAutomizer took 2343.11ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 84.6MB in the beginning and 95.6MB in the end (delta: -11.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:29,967 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.80ms. Allocated memory is still 167.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 15.95ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 94.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 9.26ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 94.0MB in the end (delta: 641.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 161.65ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 84.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2343.11ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 84.6MB in the beginning and 95.6MB in the end (delta: -11.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 163 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 114 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf93 smp100 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 80ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:29,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...