/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/complex_thr1_3indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:57,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:57,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:57,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:57,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:57,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:57,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:57,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:57,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:57,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:57,993 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:57,993 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:57,993 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:57,993 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:57,993 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:57,993 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:57,993 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:57,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:57,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:57,995 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:57,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:57,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:57,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:57,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:57,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:57,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:57,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:57,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:57,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:57,996 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:57,997 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:57,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:57,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:57,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:57,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:57,997 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:57,997 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:58,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:58,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:58,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:58,356 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:58,356 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:58,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/complex_thr1_3indep.c.bpl [2025-02-17 22:48:58,357 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/complex_thr1_3indep.c.bpl' [2025-02-17 22:48:58,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:58,369 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:58,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:58,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:58,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:58,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,385 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:58,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:58,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:58,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:58,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:58,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:58,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:58,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:58,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:58,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:58,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:48:58,448 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:58,448 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:58,448 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:48:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:48:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:48:58,448 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:58,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:58,449 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:58,485 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:58,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:58,565 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:58,565 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:58,574 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:58,574 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:58,575 INFO L201 PluginConnector]: Adding new model complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:58 BoogieIcfgContainer [2025-02-17 22:48:58,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:58,577 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:58,577 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:58,582 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:58,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:58,582 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/2) ... [2025-02-17 22:48:58,584 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ed525d6 and model type complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:58, skipping insertion in model container [2025-02-17 22:48:58,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:58,584 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:58" (2/2) ... [2025-02-17 22:48:58,585 INFO L363 chiAutomizerObserver]: Analyzing ICFG complex_thr1_3indep.c.bpl [2025-02-17 22:48:58,646 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:48:58,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 89 flow [2025-02-17 22:48:58,713 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2025-02-17 22:48:58,715 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:48:58,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 5/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-02-17 22:48:58,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 89 flow [2025-02-17 22:48:58,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 28 transitions, 74 flow [2025-02-17 22:48:58,732 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:58,910 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:58,910 INFO L101 AmpleReduction]: Number of pruned transitions: 137, Number of non-trivial ample sets: 205 [2025-02-17 22:48:58,910 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 206 [2025-02-17 22:48:58,921 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:58,921 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:58,921 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:58,921 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:58,921 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:58,921 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:58,921 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:58,922 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:58,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 194 states, 193 states have (on average 2.3108808290155443) internal successors, (446), 193 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:58,947 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 154 [2025-02-17 22:48:58,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:58,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:58,951 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:48:58,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:58,951 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:58,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 194 states, 193 states have (on average 2.3108808290155443) internal successors, (446), 193 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:58,956 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 154 [2025-02-17 22:48:58,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:58,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:58,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:48:58,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:58,963 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[76] L26-->L28-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:58,963 INFO L754 eck$LassoCheckResult]: Loop: "[79] L28-1-->L30: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[83] L30-->L31: Formula: (= (+ v_i_3 1) v_i_4) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[85] L31-->L28-1: Formula: (= (+ v_z_3 1) v_z_2) InVars {z=v_z_3} OutVars{z=v_z_2} AuxVars[] AssignedVars[z]" [2025-02-17 22:48:58,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash 3886763, now seen corresponding path program 1 times [2025-02-17 22:48:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:58,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711154922] [2025-02-17 22:48:58,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash 108368, now seen corresponding path program 1 times [2025-02-17 22:48:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567069597] [2025-02-17 22:48:59,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -173481882, now seen corresponding path program 1 times [2025-02-17 22:48:59,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631076204] [2025-02-17 22:48:59,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:59,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:59,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:59,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:59,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,110 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,111 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,111 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,111 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,112 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,218 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,218 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:48:59,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:48:59,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:48:59,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,279 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,285 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,285 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,285 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,285 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,285 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,285 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,285 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,285 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,286 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,286 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,286 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,324 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,328 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:48:59,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:59,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:59,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:59,355 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-17 22:48:59,355 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:59,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:48:59,361 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:59,361 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:59,361 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:59,362 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(i) = 1*i Supporting invariants [] [2025-02-17 22:48:59,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:48:59,388 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:59,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:48:59,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,464 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:59,527 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:48:59,533 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 194 states, 193 states have (on average 2.3108808290155443) internal successors, (446), 193 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,612 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 194 states, 193 states have (on average 2.3108808290155443) internal successors, (446), 193 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 553 states and 1277 transitions. Complement of second has 7 states. [2025-02-17 22:48:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-02-17 22:48:59,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-17 22:48:59,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:48:59,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-17 22:48:59,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 553 states and 1277 transitions. [2025-02-17 22:48:59,633 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 185 [2025-02-17 22:48:59,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 553 states to 387 states and 931 transitions. [2025-02-17 22:48:59,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2025-02-17 22:48:59,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 310 [2025-02-17 22:48:59,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 931 transitions. [2025-02-17 22:48:59,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:59,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 387 states and 931 transitions. [2025-02-17 22:48:59,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 931 transitions. [2025-02-17 22:48:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 233. [2025-02-17 22:48:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 2.48068669527897) internal successors, (578), 232 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 578 transitions. [2025-02-17 22:48:59,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 578 transitions. [2025-02-17 22:48:59,674 INFO L432 stractBuchiCegarLoop]: Abstraction has 233 states and 578 transitions. [2025-02-17 22:48:59,674 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:59,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 578 transitions. [2025-02-17 22:48:59,676 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 115 [2025-02-17 22:48:59,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:59,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,678 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[76] L26-->L28-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" "[100] L13-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:48:59,678 INFO L754 eck$LassoCheckResult]: Loop: "[88] L44-->L46: Formula: (< v_x1_1 v_y1_1) InVars {y1=v_y1_1, x1=v_x1_1} OutVars{y1=v_y1_1, x1=v_x1_1} AuxVars[] AssignedVars[]" "[90] L46-->L44: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:59,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash 120489753, now seen corresponding path program 1 times [2025-02-17 22:48:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713352976] [2025-02-17 22:48:59,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:59,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:59,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:59,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:59,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-02-17 22:48:59,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768495545] [2025-02-17 22:48:59,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,693 INFO L85 PathProgramCache]: Analyzing trace with hash -173461541, now seen corresponding path program 1 times [2025-02-17 22:48:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649020885] [2025-02-17 22:48:59,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:59,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:59,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:59,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:59,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,721 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,722 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,722 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,722 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,722 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,722 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,722 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,722 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,722 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:59,722 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,722 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,741 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:48:59,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,765 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:48:59,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,835 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,841 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,841 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,841 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,841 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,841 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,841 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,841 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:59,841 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,841 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,859 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,859 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,861 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:48:59,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:59,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:59,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:59,881 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:59,882 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:59,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,884 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:59,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:48:59,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:59,885 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:59,885 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:59,885 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, x1) = 1*y1 - 1*x1 Supporting invariants [] [2025-02-17 22:48:59,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:48:59,896 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:59,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:59,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:59,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:59,936 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:59,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 578 transitions. cyclomatic complexity: 393 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,979 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 578 transitions. cyclomatic complexity: 393. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 599 states and 1647 transitions. Complement of second has 6 states. [2025-02-17 22:48:59,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-02-17 22:48:59,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:48:59,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:48:59,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:48:59,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 599 states and 1647 transitions. [2025-02-17 22:48:59,987 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 89 [2025-02-17 22:48:59,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 599 states to 431 states and 1212 transitions. [2025-02-17 22:48:59,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2025-02-17 22:48:59,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2025-02-17 22:48:59,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 1212 transitions. [2025-02-17 22:48:59,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:59,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 431 states and 1212 transitions. [2025-02-17 22:48:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 1212 transitions. [2025-02-17 22:49:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 371. [2025-02-17 22:49:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 371 states have (on average 2.8436657681940702) internal successors, (1055), 370 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1055 transitions. [2025-02-17 22:49:00,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 371 states and 1055 transitions. [2025-02-17 22:49:00,003 INFO L432 stractBuchiCegarLoop]: Abstraction has 371 states and 1055 transitions. [2025-02-17 22:49:00,003 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:00,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 1055 transitions. [2025-02-17 22:49:00,005 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 89 [2025-02-17 22:49:00,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:00,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:49:00,006 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[76] L26-->L28-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" "[78] L28-1-->L33-1: Formula: (<= v_i_5 0) InVars {i=v_i_5} OutVars{i=v_i_5} AuxVars[] AssignedVars[]" [2025-02-17 22:49:00,006 INFO L754 eck$LassoCheckResult]: Loop: "[82] L33-1-->L35: Formula: (< v_i_6 v_y_2) InVars {i=v_i_6, y=v_y_2} OutVars{i=v_i_6, y=v_y_2} AuxVars[] AssignedVars[]" "[84] L35-->L36: Formula: (= (+ v_i_8 1) v_i_7) InVars {i=v_i_8} OutVars{i=v_i_7} AuxVars[] AssignedVars[i]" "[86] L36-->L33-1: Formula: (= v_z_5 (+ v_z_4 1)) InVars {z=v_z_5} OutVars{z=v_z_4} AuxVars[] AssignedVars[z]" [2025-02-17 22:49:00,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash 120489731, now seen corresponding path program 1 times [2025-02-17 22:49:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830347288] [2025-02-17 22:49:00,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830347288] [2025-02-17 22:49:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830347288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:00,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:49:00,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117445130] [2025-02-17 22:49:00,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:00,070 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:00,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 111283, now seen corresponding path program 1 times [2025-02-17 22:49:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126862880] [2025-02-17 22:49:00,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,074 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,098 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,099 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,099 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,099 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,099 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,099 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,099 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,099 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,099 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,099 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,099 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,130 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,131 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,135 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:49:00,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:49:00,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,207 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:49:00,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,233 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:00,233 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {z=0} Honda state: {z=0} Generalized eigenvectors: [{z=-1}, {z=7}, {z=-7}] Lambdas: [8, 1, 1] Nus: [1, 0] [2025-02-17 22:49:00,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:49:00,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,242 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:49:00,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,261 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-02-17 22:49:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,263 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:49:00,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,331 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:49:00,337 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,337 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,337 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,337 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,337 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,337 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,337 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,337 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,337 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,337 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,337 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,366 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,367 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,370 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:49:00,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:00,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:00,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:49:00,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,392 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:49:00,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:00,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,408 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:00,408 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:00,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,411 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:49:00,413 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,413 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,413 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,414 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, i) = 1*y - 1*i Supporting invariants [] [2025-02-17 22:49:00,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-17 22:49:00,421 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:00,470 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:49:00,470 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 371 states and 1055 transitions. cyclomatic complexity: 750 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,506 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 371 states and 1055 transitions. cyclomatic complexity: 750. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 797 states and 2288 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-17 22:49:00,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:49:00,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:49:00,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:49:00,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 797 states and 2288 transitions. [2025-02-17 22:49:00,513 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 52 [2025-02-17 22:49:00,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 797 states to 457 states and 1387 transitions. [2025-02-17 22:49:00,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2025-02-17 22:49:00,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2025-02-17 22:49:00,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 457 states and 1387 transitions. [2025-02-17 22:49:00,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 457 states and 1387 transitions. [2025-02-17 22:49:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states and 1387 transitions. [2025-02-17 22:49:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 374. [2025-02-17 22:49:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 374 states have (on average 3.141711229946524) internal successors, (1175), 373 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1175 transitions. [2025-02-17 22:49:00,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 374 states and 1175 transitions. [2025-02-17 22:49:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:00,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:49:00,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:49:00,530 INFO L87 Difference]: Start difference. First operand 374 states and 1175 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:00,569 INFO L93 Difference]: Finished difference Result 477 states and 1456 transitions. [2025-02-17 22:49:00,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 477 states and 1456 transitions. [2025-02-17 22:49:00,572 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 62 [2025-02-17 22:49:00,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 477 states to 477 states and 1456 transitions. [2025-02-17 22:49:00,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2025-02-17 22:49:00,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2025-02-17 22:49:00,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 477 states and 1456 transitions. [2025-02-17 22:49:00,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 477 states and 1456 transitions. [2025-02-17 22:49:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states and 1456 transitions. [2025-02-17 22:49:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 394. [2025-02-17 22:49:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 394 states have (on average 3.1370558375634516) internal successors, (1236), 393 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1236 transitions. [2025-02-17 22:49:00,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 394 states and 1236 transitions. [2025-02-17 22:49:00,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-17 22:49:00,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:49:00,608 INFO L432 stractBuchiCegarLoop]: Abstraction has 394 states and 1236 transitions. [2025-02-17 22:49:00,609 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:00,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 1236 transitions. [2025-02-17 22:49:00,610 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 46 [2025-02-17 22:49:00,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:49:00,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:00,611 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[76] L26-->L28-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" "[100] L13-->L44: 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]" "[103] L14-->L53: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:49:00,611 INFO L754 eck$LassoCheckResult]: Loop: "[92] L53-->L55: Formula: (< v_x2_1 v_y2_1) InVars {y2=v_y2_1, x2=v_x2_1} OutVars{y2=v_y2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[94] L55-->L53: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:00,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash -559784850, now seen corresponding path program 1 times [2025-02-17 22:49:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277416083] [2025-02-17 22:49:00,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-02-17 22:49:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957444834] [2025-02-17 22:49:00,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1082325904, now seen corresponding path program 1 times [2025-02-17 22:49:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495851342] [2025-02-17 22:49:00,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:00,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:00,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:00,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,661 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,661 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:00,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,661 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,682 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,682 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,684 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:49:00,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:49:00,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,706 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:49:00,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,759 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-17 22:49:00,763 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,763 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,763 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,764 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,764 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,764 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,764 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,764 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:00,764 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,764 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,777 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,777 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,779 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:49:00,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:00,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,799 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:00,799 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:00,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,801 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:00,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:49:00,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,803 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,803 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,803 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = 1*y2 - 1*x2 Supporting invariants [] [2025-02-17 22:49:00,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,810 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,844 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:00,855 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:49:00,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 394 states and 1236 transitions. cyclomatic complexity: 903 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,885 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 394 states and 1236 transitions. cyclomatic complexity: 903. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1032 states and 3231 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-02-17 22:49:00,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:00,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:00,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:49:00,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1032 states and 3231 transitions. [2025-02-17 22:49:00,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:00,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1032 states to 0 states and 0 transitions. [2025-02-17 22:49:00,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:00,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:00,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:00,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:00,894 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,894 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,894 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:00,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:00,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:00,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:00,899 INFO L201 PluginConnector]: Adding new model complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:00 BoogieIcfgContainer [2025-02-17 22:49:00,899 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:00,899 INFO L158 Benchmark]: Toolchain (without parser) took 2530.29ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 95.6MB in the beginning and 79.9MB in the end (delta: 15.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,900 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.03ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 93.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,900 INFO L158 Benchmark]: Boogie Preprocessor took 11.16ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 92.9MB in the end (delta: 719.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,900 INFO L158 Benchmark]: RCFGBuilder took 176.55ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 83.5MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,900 INFO L158 Benchmark]: BuchiAutomizer took 2321.90ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 83.5MB in the beginning and 79.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,901 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.12ms. Allocated memory is still 167.8MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.03ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 93.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 11.16ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 92.9MB in the end (delta: 719.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 176.55ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 83.5MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2321.90ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 83.5MB in the beginning and 79.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + y1 and consists of 4 locations. One deterministic module has affine ranking function y + -1 * i and consists of 4 locations. One deterministic module has affine ranking function y2 + -1 * x2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 380 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 165 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp84 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 32ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 235, Trivial Ample Sets caused by loops: 206, Number of non-trivial ample sets: 205, Number of pruned transitions: 137, Number of transitions in reduction automaton: 446, Number of states in reduction automaton: 194, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:00,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:49:01,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...