/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/c4-barrier-2t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:27,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:27,270 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,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:27,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:27,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:27,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:27,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:27,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:27,292 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:27,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:27,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:27,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:27,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:27,293 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:27,293 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:27,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:27,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:27,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:27,512 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:27,513 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:27,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/c4-barrier-2t.c.bpl [2025-02-17 22:45:27,514 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/c4-barrier-2t.c.bpl' [2025-02-17 22:45:27,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:27,529 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:27,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:27,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:27,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:27,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "c4-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,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "c4-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,548 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:27,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:27,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:27,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:27,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:27,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "c4-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,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "c4-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,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "c4-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,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "c4-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,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "c4-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,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "c4-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,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "c4-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,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "c4-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,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "c4-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,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:27,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:27,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:27,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:27,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "c4-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,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,611 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,614 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,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:27,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:27,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:27,636 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:27,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:27,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:27,636 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:27,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:27,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:27,637 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,671 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:27,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:27,741 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:27,742 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:27,750 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:27,750 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:27,750 INFO L201 PluginConnector]: Adding new model c4-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,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:27,751 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:27,751 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:27,756 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:27,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:27,757 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c4-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,758 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f15e672 and model type c4-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,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:27,759 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c4-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,760 INFO L363 chiAutomizerObserver]: Analyzing ICFG c4-barrier-2t.c.bpl [2025-02-17 22:45:27,827 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:45:27,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 30 transitions, 74 flow [2025-02-17 22:45:27,895 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-02-17 22:45:27,898 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:45:27,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-17 22:45:27,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 30 transitions, 74 flow [2025-02-17 22:45:27,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-02-17 22:45:27,914 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:27,914 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:27,914 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:27,914 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:27,914 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:27,915 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:27,915 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:27,915 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:27,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:27,962 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 74 [2025-02-17 22:45:27,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:27,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:27,966 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:27,966 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:27,966 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:27,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 101 states, but on-demand construction may add more states [2025-02-17 22:45:27,971 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 74 [2025-02-17 22:45:27,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:27,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:27,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:27,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:27,976 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (and (= v_x2_7 0) (= v_x5_5 0)) InVars {x5=v_x5_5, x2=v_x2_7} OutVars{x5=v_x5_5, x2=v_x2_7} AuxVars[] AssignedVars[]" "[88] 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,978 INFO L754 eck$LassoCheckResult]: Loop: "[67] 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[]" "[69] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[71] 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,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2940, now seen corresponding path program 1 times [2025-02-17 22:45:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768583114] [2025-02-17 22:45:27,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:28,043 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,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:28,052 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,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,078 INFO L85 PathProgramCache]: Analyzing trace with hash 96388, now seen corresponding path program 1 times [2025-02-17 22:45:28,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58746291] [2025-02-17 22:45:28,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,088 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,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,092 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,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash 87652137, now seen corresponding path program 1 times [2025-02-17 22:45:28,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988129463] [2025-02-17 22:45:28,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,185 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,186 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,186 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,186 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,186 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:28,186 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,186 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,187 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,187 INFO L132 ssoRankerPreferences]: Filename of dumped script: c4-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:28,187 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,187 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,254 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,254 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:28,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,261 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,262 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,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:28,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,282 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,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,314 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,316 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,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:28,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,408 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:28,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:45:28,413 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,413 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,413 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,413 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,413 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:28,413 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,413 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,413 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,413 INFO L132 ssoRankerPreferences]: Filename of dumped script: c4-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:28,413 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,413 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,448 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,451 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:28,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,453 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,455 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,456 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,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:28,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:28,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:28,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:28,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:28,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:28,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:28,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:28,481 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:28,481 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:28,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,504 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,507 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,508 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:28,508 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:28,508 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:28,509 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,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:28,517 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:28,544 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,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:28,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:28,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:28,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,556 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,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:28,557 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:28,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:28,616 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,654 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,666 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,669 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 101 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,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 101 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 239 states and 539 transitions. Complement of second has 6 states. [2025-02-17 22:45:28,818 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,821 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-02-17 22:45:28,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-17 22:45:28,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:45:28,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-17 22:45:28,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 539 transitions. [2025-02-17 22:45:28,856 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 59 [2025-02-17 22:45:28,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 152 states and 345 transitions. [2025-02-17 22:45:28,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-02-17 22:45:28,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2025-02-17 22:45:28,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 345 transitions. [2025-02-17 22:45:28,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:28,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 345 transitions. [2025-02-17 22:45:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 345 transitions. [2025-02-17 22:45:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2025-02-17 22:45:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 2.287878787878788) internal successors, (302), 131 states have internal predecessors, (302), 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,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 302 transitions. [2025-02-17 22:45:28,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 302 transitions. [2025-02-17 22:45:28,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 132 states and 302 transitions. [2025-02-17 22:45:28,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:28,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 302 transitions. [2025-02-17 22:45:28,898 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 59 [2025-02-17 22:45:28,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:28,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:28,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:28,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:28,899 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (and (= v_x2_7 0) (= v_x5_5 0)) InVars {x5=v_x5_5, x2=v_x2_7} OutVars{x5=v_x5_5, x2=v_x2_7} AuxVars[] AssignedVars[]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] 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,899 INFO L754 eck$LassoCheckResult]: Loop: "[78] L39-->L41: Formula: (< v_x3_5 v_z_6) InVars {x3=v_x3_5, z=v_z_6} OutVars{x3=v_x3_5, z=v_z_6} AuxVars[] AssignedVars[]" "[80] L41-->L39: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-02-17 22:45:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash 91231, now seen corresponding path program 1 times [2025-02-17 22:45:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958373492] [2025-02-17 22:45:28,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,904 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,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,907 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,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,908 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-02-17 22:45:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415938216] [2025-02-17 22:45:28,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:28,912 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,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:28,914 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,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash 87675489, now seen corresponding path program 1 times [2025-02-17 22:45:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199656722] [2025-02-17 22:45:28,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,940 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,941 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,941 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,941 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:28,941 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,941 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,941 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,941 INFO L132 ssoRankerPreferences]: Filename of dumped script: c4-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:28,941 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,941 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,970 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,970 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:28,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,972 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,973 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,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:28,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:45:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,993 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,994 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,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:28,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,068 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:29,073 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:29,073 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,073 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:29,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: c4-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:29,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,074 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,095 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,095 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:29,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,097 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,098 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,099 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,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,113 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:29,116 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:29,116 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:29,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,118 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,120 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,121 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:29,121 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:29,121 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:29,121 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-02-17 22:45:29,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:45:29,129 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,147 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,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:29,158 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,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,174 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,175 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,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 302 transitions. cyclomatic complexity: 200 Second operand has 3 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,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 302 transitions. cyclomatic complexity: 200. Second operand has 3 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) Result 331 states and 811 transitions. Complement of second has 6 states. [2025-02-17 22:45:29,263 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,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 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,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-02-17 22:45:29,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:45:29,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:45:29,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:45:29,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 811 transitions. [2025-02-17 22:45:29,269 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 43 [2025-02-17 22:45:29,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 197 states and 467 transitions. [2025-02-17 22:45:29,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-02-17 22:45:29,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2025-02-17 22:45:29,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 467 transitions. [2025-02-17 22:45:29,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:29,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 197 states and 467 transitions. [2025-02-17 22:45:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 467 transitions. [2025-02-17 22:45:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 177. [2025-02-17 22:45:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 2.406779661016949) internal successors, (426), 176 states have internal predecessors, (426), 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,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 426 transitions. [2025-02-17 22:45:29,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 177 states and 426 transitions. [2025-02-17 22:45:29,282 INFO L432 stractBuchiCegarLoop]: Abstraction has 177 states and 426 transitions. [2025-02-17 22:45:29,282 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:29,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 426 transitions. [2025-02-17 22:45:29,283 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 43 [2025-02-17 22:45:29,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:29,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:29,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:29,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:29,283 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (and (= v_x2_7 0) (= v_x5_5 0)) InVars {x5=v_x5_5, x2=v_x2_7} OutVars{x5=v_x5_5, x2=v_x2_7} AuxVars[] AssignedVars[]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] 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[]" "[68] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] 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,284 INFO L754 eck$LassoCheckResult]: Loop: "[73] 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[]" "[75] L31-->L32: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" "[76] 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,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash 87651144, now seen corresponding path program 1 times [2025-02-17 22:45:29,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459765126] [2025-02-17 22:45:29,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:29,288 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,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,327 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,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459765126] [2025-02-17 22:45:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459765126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:29,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:45:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361886744] [2025-02-17 22:45:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:29,334 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:45:29,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-02-17 22:45:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089261921] [2025-02-17 22:45:29,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,338 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,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,339 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,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,363 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,363 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:29,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: c4-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:29,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,363 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,388 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,388 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,393 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,394 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,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,411 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,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,413 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,414 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,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:29,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,497 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:29,501 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,501 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,501 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,501 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,501 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,501 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:29,501 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,501 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,501 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,501 INFO L132 ssoRankerPreferences]: Filename of dumped script: c4-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:29,501 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,501 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,529 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,529 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:29,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,533 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,535 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,538 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,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:29,558 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:29,558 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:29,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,563 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,564 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,564 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:29,564 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:29,564 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:29,565 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,570 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,571 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:29,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:29,589 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,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,604 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,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,605 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,640 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,642 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,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 426 transitions. cyclomatic complexity: 281 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,711 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 426 transitions. cyclomatic complexity: 281. 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 366 states and 924 transitions. Complement of second has 6 states. [2025-02-17 22:45:29,711 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,712 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,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-02-17 22:45:29,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:45:29,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:45:29,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:45:29,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 924 transitions. [2025-02-17 22:45:29,716 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-02-17 22:45:29,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 264 states and 677 transitions. [2025-02-17 22:45:29,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2025-02-17 22:45:29,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2025-02-17 22:45:29,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 677 transitions. [2025-02-17 22:45:29,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:29,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 264 states and 677 transitions. [2025-02-17 22:45:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 677 transitions. [2025-02-17 22:45:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 230. [2025-02-17 22:45:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 2.617391304347826) internal successors, (602), 229 states have internal predecessors, (602), 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,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 602 transitions. [2025-02-17 22:45:29,734 INFO L240 hiAutomatonCegarLoop]: Abstraction has 230 states and 602 transitions. [2025-02-17 22:45:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:29,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:45:29,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:45:29,735 INFO L87 Difference]: Start difference. First operand 230 states and 602 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,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:29,757 INFO L93 Difference]: Finished difference Result 92 states and 213 transitions. [2025-02-17 22:45:29,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 213 transitions. [2025-02-17 22:45:29,758 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:45:29,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 213 transitions. [2025-02-17 22:45:29,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-02-17 22:45:29,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-02-17 22:45:29,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 213 transitions. [2025-02-17 22:45:29,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:29,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 213 transitions. [2025-02-17 22:45:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 213 transitions. [2025-02-17 22:45:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-17 22:45:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 2.3152173913043477) internal successors, (213), 91 states have internal predecessors, (213), 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,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 213 transitions. [2025-02-17 22:45:29,764 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 213 transitions. [2025-02-17 22:45:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:45:29,769 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 213 transitions. [2025-02-17 22:45:29,769 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:29,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 213 transitions. [2025-02-17 22:45:29,770 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-02-17 22:45:29,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:29,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:29,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:29,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:29,770 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (and (= v_x2_7 0) (= v_x5_5 0)) InVars {x5=v_x5_5, x2=v_x2_7} OutVars{x5=v_x5_5, x2=v_x2_7} AuxVars[] AssignedVars[]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] 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[]" "[68] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[91] 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]" "[77] L39-->L43: Formula: (<= v_z_7 v_x3_8) InVars {x3=v_x3_8, z=v_z_7} OutVars{x3=v_x3_8, z=v_z_7} AuxVars[] AssignedVars[]" "[79] L43-->L44: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[81] L44-->L45-1: Formula: (<= 2 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-02-17 22:45:29,770 INFO L754 eck$LassoCheckResult]: Loop: "[83] L45-1-->L47: 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[]" "[85] L47-->L45-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,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash -124182926, now seen corresponding path program 1 times [2025-02-17 22:45:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415572531] [2025-02-17 22:45:29,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:29,780 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,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:29,787 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,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-02-17 22:45:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034446263] [2025-02-17 22:45:29,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:29,793 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,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:29,795 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,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash 919295060, now seen corresponding path program 1 times [2025-02-17 22:45:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178470750] [2025-02-17 22:45:29,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:29,805 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,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:29,811 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,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,829 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,829 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,829 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,829 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:29,829 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,829 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,829 INFO L132 ssoRankerPreferences]: Filename of dumped script: c4-barrier-2t.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:29,829 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,829 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,849 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,849 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:29,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,851 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,852 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,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,868 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,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,870 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,870 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,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:29,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,934 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:29,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-17 22:45:29,938 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,938 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,938 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,939 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,939 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:29,939 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,939 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,939 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,939 INFO L132 ssoRankerPreferences]: Filename of dumped script: c4-barrier-2t.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:29,939 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,939 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,953 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,953 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:29,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,955 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,956 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,957 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,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,969 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:29,972 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:29,972 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:29,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,974 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,976 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,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:29,977 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:29,977 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:29,977 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:45:29,982 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,983 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:29,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:30,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:30,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:30,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:30,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:30,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:30,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:30,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:30,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:30,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:30,029 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:30,030 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:30,030 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 213 transitions. cyclomatic complexity: 139 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:30,057 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 213 transitions. cyclomatic complexity: 139. 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 157 states and 370 transitions. Complement of second has 6 states. [2025-02-17 22:45:30,057 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:30,058 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:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-02-17 22:45:30,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:45:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:45:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:45:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 370 transitions. [2025-02-17 22:45:30,059 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:30,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 0 states and 0 transitions. [2025-02-17 22:45:30,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:30,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:30,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:30,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:30,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:30,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:30,060 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:30,060 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:45:30,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:30,060 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:30,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:30,066 INFO L201 PluginConnector]: Adding new model c4-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:30 BoogieIcfgContainer [2025-02-17 22:45:30,066 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:30,067 INFO L158 Benchmark]: Toolchain (without parser) took 2537.40ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.4MB in the beginning and 41.0MB in the end (delta: 46.4MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. [2025-02-17 22:45:30,067 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 88.2MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:30,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.51ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 86.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:30,067 INFO L158 Benchmark]: Boogie Preprocessor took 17.09ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 85.3MB in the end (delta: 857.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:30,068 INFO L158 Benchmark]: RCFGBuilder took 183.23ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 75.4MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:45:30,068 INFO L158 Benchmark]: BuchiAutomizer took 2314.91ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.4MB in the beginning and 41.0MB in the end (delta: 34.4MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2025-02-17 22:45:30,069 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.25ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 88.2MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.51ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 86.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.09ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 85.3MB in the end (delta: 857.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 183.23ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 75.4MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2314.91ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.4MB in the beginning and 41.0MB in the end (delta: 34.4MB). Peak memory consumption was 32.6MB. 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 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 4 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.1s 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, 74 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, 166 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 110 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf93 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 57ms 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:30,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:30,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:45:30,498 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:30,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...