/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/interleaved2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:43,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:43,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:43,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:43,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:43,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:43,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:43,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:43,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:43,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:43,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:43,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:43,652 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:43,652 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:43,652 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:43,652 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:43,652 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:43,652 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:43,652 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:43,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:43,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:43,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:43,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:43,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:43,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:43,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:43,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:43,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:43,654 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:43,654 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:43,654 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:43,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:43,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:43,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:43,908 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:43,908 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:43,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/interleaved2.c.bpl [2025-04-26 16:56:43,910 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/interleaved2.c.bpl' [2025-04-26 16:56:43,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:43,926 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:43,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:43,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:43,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:43,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,960 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:43,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:43,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:43,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:43,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:43,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:43,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:43,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:43,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:43,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/1) ... [2025-04-26 16:56:43,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:44,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:44,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:44,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:44,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:44,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:44,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:44,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:44,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:44,038 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:44,073 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:44,075 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:44,150 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:44,150 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:44,165 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:44,166 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:44,168 INFO L201 PluginConnector]: Adding new model interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:44 BoogieIcfgContainer [2025-04-26 16:56:44,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:44,168 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:44,168 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:44,173 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:44,174 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:44,174 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:43" (1/2) ... [2025-04-26 16:56:44,176 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c9db2fb and model type interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:44, skipping insertion in model container [2025-04-26 16:56:44,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:44,176 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:44" (2/2) ... [2025-04-26 16:56:44,176 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved2.c.bpl [2025-04-26 16:56:44,219 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:44,247 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:44,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:44,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:44,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:44,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:44,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 22 transitions, 58 flow [2025-04-26 16:56:44,315 INFO L116 PetriNetUnfolderBase]: 2/18 cut-off events. [2025-04-26 16:56:44,316 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:44,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 2/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-26 16:56:44,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 22 transitions, 58 flow [2025-04-26 16:56:44,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 48 flow [2025-04-26 16:56:44,322 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 23 places, 18 transitions, 48 flow [2025-04-26 16:56:44,327 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:44,403 WARN L140 AmpleReduction]: Number of pruned transitions: 22 [2025-04-26 16:56:44,404 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:44,404 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 16:56:44,404 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:22 [2025-04-26 16:56:44,404 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:22 [2025-04-26 16:56:44,404 WARN L145 AmpleReduction]: Times succ was already a loop node:6 [2025-04-26 16:56:44,404 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:7 [2025-04-26 16:56:44,404 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:44,409 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:44,417 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:44,417 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:44,417 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:44,417 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:44,417 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:44,417 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:44,417 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:44,417 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:44,419 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:44,432 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 36 [2025-04-26 16:56:44,433 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:44,433 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:44,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:44,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:44,436 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:44,436 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:44,438 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 36 [2025-04-26 16:56:44,439 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:44,439 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:44,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:44,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:44,444 INFO L752 eck$LassoCheckResult]: Stem: "[40] $Ultimate##0-->L12: Formula: (and (= v_f2_4 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} OutVars{x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} AuxVars[] AssignedVars[]" "[60] L12-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:44,444 INFO L754 eck$LassoCheckResult]: Loop: "[47] L25-1-->L23: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[49] L23-->L24: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[50] L24-->L25: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[51] L25-->L25-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" [2025-04-26 16:56:44,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:44,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2261, now seen corresponding path program 1 times [2025-04-26 16:56:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:44,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691810165] [2025-04-26 16:56:44,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:44,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:44,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:44,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:44,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:44,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:44,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:44,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:44,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:44,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:44,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2372388, now seen corresponding path program 1 times [2025-04-26 16:56:44,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:44,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570360178] [2025-04-26 16:56:44,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:44,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:44,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:44,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:44,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:44,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:44,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:44,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:44,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:44,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:44,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:44,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:44,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2089529848, now seen corresponding path program 1 times [2025-04-26 16:56:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:44,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126047752] [2025-04-26 16:56:44,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:44,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:44,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:44,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:44,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:44,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:44,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126047752] [2025-04-26 16:56:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126047752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:44,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:44,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:56:44,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223436582] [2025-04-26 16:56:44,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:44,686 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:44,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:44,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:44,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:44,688 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:44,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:44,689 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:44,689 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:44,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:44,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:44,689 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:44,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:44,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:44,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:44,799 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:44,799 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:44,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:44,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:44,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:44,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:44,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:44,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:44,840 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:44,840 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:44,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:44,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:44,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:44,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:44,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:44,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:44,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:44,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:56:44,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:44,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:44,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:44,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:44,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:44,903 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:44,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:44,907 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:44,907 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:44,908 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:44,908 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:44,908 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:44,908 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:44,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:44,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:44,908 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:44,908 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:44,908 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:44,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:44,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:44,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:44,961 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:44,964 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:44,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:44,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:44,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:44,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:44,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:44,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:44,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:44,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:44,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:44,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:44,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:44,989 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:44,989 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:44,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:44,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:44,992 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:44,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:44,994 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:44,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:44,998 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:44,999 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:44,999 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f1) = 1*f1 Supporting invariants [] [2025-04-26 16:56:45,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:45,010 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:45,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:45,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:45,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:45,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:45,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:45,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:45,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:45,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:45,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:45,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:45,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:45,073 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:56:45,075 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,116 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 123 states and 166 transitions. Complement of second has 5 states. [2025-04-26 16:56:45,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-04-26 16:56:45,127 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:56:45,127 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:45,127 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:56:45,128 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:45,128 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 16:56:45,128 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:45,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 166 transitions. [2025-04-26 16:56:45,133 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 32 [2025-04-26 16:56:45,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 75 states and 102 transitions. [2025-04-26 16:56:45,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-04-26 16:56:45,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-04-26 16:56:45,138 INFO L74 IsDeterministic]: Start isDeterministic. Operand 75 states and 102 transitions. [2025-04-26 16:56:45,138 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:45,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 102 transitions. [2025-04-26 16:56:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 102 transitions. [2025-04-26 16:56:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2025-04-26 16:56:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.393939393939394) internal successors, (in total 92), 65 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-04-26 16:56:45,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-04-26 16:56:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:45,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:45,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:45,163 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:45,190 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2025-04-26 16:56:45,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 96 transitions. [2025-04-26 16:56:45,191 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2025-04-26 16:56:45,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 54 states and 69 transitions. [2025-04-26 16:56:45,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 16:56:45,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 16:56:45,192 INFO L74 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2025-04-26 16:56:45,195 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:45,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-04-26 16:56:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2025-04-26 16:56:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2025-04-26 16:56:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.3) internal successors, (in total 52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-04-26 16:56:45,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-04-26 16:56:45,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:45,200 INFO L438 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-04-26 16:56:45,200 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:45,200 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2025-04-26 16:56:45,201 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2025-04-26 16:56:45,201 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:45,201 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:45,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:45,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:45,201 INFO L752 eck$LassoCheckResult]: Stem: "[40] $Ultimate##0-->L12: Formula: (and (= v_f2_4 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} OutVars{x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} AuxVars[] AssignedVars[]" "[60] L12-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[46] L25-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[48] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[63] L12-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:45,202 INFO L754 eck$LassoCheckResult]: Loop: "[53] L36-->L38: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[55] L38-->L38-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[56] L38-1-->L44: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[57] L44-->L36: Formula: (= v_f1_3 1) InVars {} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[f1]" [2025-04-26 16:56:45,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash 67403208, now seen corresponding path program 1 times [2025-04-26 16:56:45,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:45,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216653971] [2025-04-26 16:56:45,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:45,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:45,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:45,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:45,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:45,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:45,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:45,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2557092, now seen corresponding path program 1 times [2025-04-26 16:56:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:45,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832284458] [2025-04-26 16:56:45,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:45,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:45,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:45,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:45,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:45,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:45,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:45,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1318668011, now seen corresponding path program 1 times [2025-04-26 16:56:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:45,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779812959] [2025-04-26 16:56:45,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:45,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:45,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:45,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:45,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779812959] [2025-04-26 16:56:45,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779812959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:45,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:45,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:56:45,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839413820] [2025-04-26 16:56:45,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:45,303 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:45,303 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:45,303 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:45,303 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:45,303 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:45,303 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,303 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:45,304 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:45,304 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:45,304 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:45,304 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:45,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,358 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:45,358 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:45,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:45,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:45,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:45,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:45,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:56:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,380 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:45,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:45,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:45,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:45,405 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:45,409 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-04-26 16:56:45,409 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:45,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:45,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:45,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:45,409 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:45,410 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,410 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:45,410 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:45,410 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:45,410 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:45,410 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:45,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,457 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:45,457 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:45,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,459 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:45,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:45,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:45,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:45,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:45,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:45,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:45,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:45,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:45,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:45,473 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:45,477 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:45,477 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:45,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,479 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:45,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:45,480 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:45,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:56:45,483 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:45,484 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:45,484 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f2) = 1*f2 Supporting invariants [] [2025-04-26 16:56:45,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:56:45,490 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:45,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:45,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:45,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:45,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:45,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:45,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:45,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:45,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:45,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:45,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:45,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:45,559 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:45,559 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 52 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,572 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 52 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 99 states and 130 transitions. Complement of second has 5 states. [2025-04-26 16:56:45,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-26 16:56:45,573 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:56:45,573 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:45,573 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:56:45,573 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:45,573 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:56:45,574 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:45,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 130 transitions. [2025-04-26 16:56:45,575 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2025-04-26 16:56:45,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 71 states and 93 transitions. [2025-04-26 16:56:45,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-04-26 16:56:45,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-04-26 16:56:45,578 INFO L74 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2025-04-26 16:56:45,579 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:45,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2025-04-26 16:56:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2025-04-26 16:56:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2025-04-26 16:56:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.3088235294117647) internal successors, (in total 89), 67 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2025-04-26 16:56:45,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-04-26 16:56:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:45,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:45,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:45,585 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:45,594 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-04-26 16:56:45,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2025-04-26 16:56:45,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 16:56:45,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 24 states and 25 transitions. [2025-04-26 16:56:45,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-04-26 16:56:45,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-04-26 16:56:45,595 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2025-04-26 16:56:45,596 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:45,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-04-26 16:56:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2025-04-26 16:56:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2025-04-26 16:56:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (in total 17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-04-26 16:56:45,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-04-26 16:56:45,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:45,598 INFO L438 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-04-26 16:56:45,598 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:45,598 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2025-04-26 16:56:45,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 16:56:45,598 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:45,598 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:45,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:45,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:45,599 INFO L752 eck$LassoCheckResult]: Stem: "[40] $Ultimate##0-->L12: Formula: (and (= v_f2_4 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} OutVars{x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} AuxVars[] AssignedVars[]" "[60] L12-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[47] L25-1-->L23: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[49] L23-->L24: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[63] L12-1-->L36: 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]" "[53] L36-->L38: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:45,599 INFO L754 eck$LassoCheckResult]: Loop: "[50] L24-->L25: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[55] L38-->L38-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[56] L38-1-->L44: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[57] L44-->L36: Formula: (= v_f1_3 1) InVars {} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[f1]" "[53] L36-->L38: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[51] L25-->L25-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" "[47] L25-1-->L23: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[49] L23-->L24: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:45,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2089530253, now seen corresponding path program 1 times [2025-04-26 16:56:45,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:45,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892895026] [2025-04-26 16:56:45,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:45,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:45,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:45,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:45,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:45,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:45,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:45,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1635686137, now seen corresponding path program 1 times [2025-04-26 16:56:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:45,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889987916] [2025-04-26 16:56:45,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:45,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:45,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:45,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:45,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:45,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:45,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:45,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1326895251, now seen corresponding path program 1 times [2025-04-26 16:56:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:45,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263455789] [2025-04-26 16:56:45,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:45,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:45,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:45,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:45,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:45,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:45,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:45,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:45,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:45,682 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:45,682 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:45,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:45,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:45,682 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:45,682 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:45,682 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:45,682 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:45,682 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:45,682 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:45,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,731 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:45,731 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:45,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,733 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:45,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:45,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:45,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:45,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,757 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:45,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:45,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:45,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:45,890 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:45,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:45,896 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:45,897 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:45,897 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:45,897 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:45,897 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:45,897 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,897 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:45,897 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:45,897 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:45,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:45,897 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:45,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:45,950 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:45,950 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:45,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,956 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-04-26 16:56:45,957 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-04-26 16:56:45,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:45,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:45,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:45,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:45,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:45,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:45,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:45,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:45,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:45,979 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:45,980 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:45,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:45,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,982 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-04-26 16:56:45,984 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-04-26 16:56:45,985 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:45,987 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:45,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:45,988 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:45,988 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:45,988 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:56:45,994 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-04-26 16:56:45,995 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:46,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:46,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:46,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:46,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:46,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:46,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:46,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:46,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:46,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:46,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:46,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:46,050 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:46,051 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 17 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:46,072 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 17 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 26 states and 29 transitions. Complement of second has 6 states. [2025-04-26 16:56:46,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-04-26 16:56:46,073 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2025-04-26 16:56:46,073 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:46,073 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:56:46,073 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:46,073 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 16 letters. [2025-04-26 16:56:46,073 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:46,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2025-04-26 16:56:46,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:46,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2025-04-26 16:56:46,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:46,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:46,074 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:46,074 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:46,074 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:46,074 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:46,074 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:46,074 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:46,074 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:46,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:46,074 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:46,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:46,085 INFO L201 PluginConnector]: Adding new model interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:46 BoogieIcfgContainer [2025-04-26 16:56:46,085 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:46,086 INFO L158 Benchmark]: Toolchain (without parser) took 2159.31ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 84.1MB in the beginning and 37.9MB in the end (delta: 46.3MB). Peak memory consumption was 42.8MB. Max. memory is 8.0GB. [2025-04-26 16:56:46,086 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.9MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:46,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.23ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 82.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:46,086 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 81.3MB in the end (delta: 934.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:46,087 INFO L158 Benchmark]: RCFGBuilder took 183.02ms. Allocated memory is still 159.4MB. Free memory was 81.1MB in the beginning and 72.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:46,087 INFO L158 Benchmark]: BuchiAutomizer took 1917.08ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.1MB in the beginning and 37.9MB in the end (delta: 34.2MB). Peak memory consumption was 30.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:46,088 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.71ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.9MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.23ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 82.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 81.3MB in the end (delta: 934.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 183.02ms. Allocated memory is still 159.4MB. Free memory was 81.1MB in the beginning and 72.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1917.08ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.1MB in the beginning and 37.9MB in the end (delta: 34.2MB). Peak memory consumption was 30.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 54 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 34ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 161, Number of transitions in reduction automaton: 66, Number of states in reduction automaton: 48, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function f1 and consists of 3 locations. One deterministic module has affine ranking function f2 and consists of 3 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:46,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...