/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/indep_loops_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:58,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:58,315 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:58,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:58,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:58,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:58,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:58,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:58,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:58,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:58,346 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:58,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:58,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:58,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:58,347 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:58,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:58,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:58,347 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:58,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:58,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:58,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:58,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:58,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:58,347 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:58,347 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,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:58,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:58,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:58,567 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:58,568 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:58,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/indep_loops_3.c.bpl [2025-02-17 22:48:58,570 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/indep_loops_3.c.bpl' [2025-02-17 22:48:58,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:58,586 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:58,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:58,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:58,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:58,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,603 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:58,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:58,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:58,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:58,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:58,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:58,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:58,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:58,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:58,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,644 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,649 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,667 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:58,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:58,668 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:58,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:58,668 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:48:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:48:58,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:48:58,669 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:58,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:58,669 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,705 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:58,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:58,764 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:58,764 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:58,775 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:58,775 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:58,776 INFO L201 PluginConnector]: Adding new model indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:58 BoogieIcfgContainer [2025-02-17 22:48:58,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:58,777 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:58,777 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:58,781 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:58,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:58,782 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/2) ... [2025-02-17 22:48:58,784 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25a1c567 and model type indep_loops_3.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,784 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:58,784 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:58" (2/2) ... [2025-02-17 22:48:58,785 INFO L363 chiAutomizerObserver]: Analyzing ICFG indep_loops_3.c.bpl [2025-02-17 22:48:58,852 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:48:58,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 71 flow [2025-02-17 22:48:58,918 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-02-17 22:48:58,921 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:48:58,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 3/19 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-02-17 22:48:58,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 25 transitions, 71 flow [2025-02-17 22:48:58,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 19 transitions, 56 flow [2025-02-17 22:48:58,937 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:59,065 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:59,065 INFO L101 AmpleReduction]: Number of pruned transitions: 46, Number of non-trivial ample sets: 117 [2025-02-17 22:48:59,065 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 116 [2025-02-17 22:48:59,071 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:59,071 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:59,071 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:59,071 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:59,071 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:59,071 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:59,071 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:59,072 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:59,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 107 states, 106 states have (on average 2.4622641509433962) internal successors, (261), 106 states have internal predecessors, (261), 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,089 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-02-17 22:48:59,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:59,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,093 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:59,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 107 states, 106 states have (on average 2.4622641509433962) internal successors, (261), 106 states have internal predecessors, (261), 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,097 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-02-17 22:48:59,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:59,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,101 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:48:59,101 INFO L754 eck$LassoCheckResult]: Loop: "[48] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[50] L25-->L23: 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,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 1 times [2025-02-17 22:48:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349215964] [2025-02-17 22:48:59,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:59,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:59,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:59,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:59,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2025-02-17 22:48:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020394023] [2025-02-17 22:48:59,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,177 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,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,179 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,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 89950, now seen corresponding path program 1 times [2025-02-17 22:48:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22910293] [2025-02-17 22:48:59,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,189 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,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,191 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,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,237 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,238 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,239 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,239 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,239 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,290 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,297 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,300 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,305 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,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,330 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,331 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,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,424 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:48:59,428 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,429 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,429 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,429 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,429 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,456 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,459 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,462 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,463 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,465 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,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:59,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:59,492 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:59,492 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,495 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,497 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,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:59,498 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:59,498 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:59,499 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:48:59,504 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,507 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:59,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:59,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:59,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,557 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-02-17 22:48:59,558 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,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,564 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,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,565 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,590 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,616 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,618 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 107 states, 106 states have (on average 2.4622641509433962) internal successors, (261), 106 states have internal predecessors, (261), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 107 states, 106 states have (on average 2.4622641509433962) internal successors, (261), 106 states have internal predecessors, (261), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 286 states and 775 transitions. Complement of second has 6 states. [2025-02-17 22:48:59,756 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,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-02-17 22:48:59,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:48:59,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:48:59,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:48:59,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 775 transitions. [2025-02-17 22:48:59,782 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 59 [2025-02-17 22:48:59,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 166 states and 467 transitions. [2025-02-17 22:48:59,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-02-17 22:48:59,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2025-02-17 22:48:59,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 467 transitions. [2025-02-17 22:48:59,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:59,794 INFO L218 hiAutomatonCegarLoop]: Abstraction has 166 states and 467 transitions. [2025-02-17 22:48:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 467 transitions. [2025-02-17 22:48:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2025-02-17 22:48:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 2.872) internal successors, (359), 124 states have internal predecessors, (359), 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,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 359 transitions. [2025-02-17 22:48:59,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 359 transitions. [2025-02-17 22:48:59,823 INFO L432 stractBuchiCegarLoop]: Abstraction has 125 states and 359 transitions. [2025-02-17 22:48:59,823 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:59,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 359 transitions. [2025-02-17 22:48:59,825 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 59 [2025-02-17 22:48:59,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:59,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,826 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[64] L12-->L32: 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,826 INFO L754 eck$LassoCheckResult]: Loop: "[52] L32-->L34: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[54] L34-->L32: 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:48:59,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2916, now seen corresponding path program 1 times [2025-02-17 22:48:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268458351] [2025-02-17 22:48:59,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,832 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,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,835 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,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2627, now seen corresponding path program 1 times [2025-02-17 22:48:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599185313] [2025-02-17 22:48:59,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,844 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,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,845 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,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2803942, now seen corresponding path program 1 times [2025-02-17 22:48:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671244025] [2025-02-17 22:48:59,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,856 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,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,858 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,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,882 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,883 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,883 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,883 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,883 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,883 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,883 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,883 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,883 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:59,883 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,883 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,906 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,907 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,909 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,910 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,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:48:59,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,933 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,934 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,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,005 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,009 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:49:00,010 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,010 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,010 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,010 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,010 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,010 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,010 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:00,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,036 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,036 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,038 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:49:00,040 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:49:00,041 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,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,056 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:00,056 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:00,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,058 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:49:00,060 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:49:00,061 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,061 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,061 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,061 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:49:00,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,068 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,084 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,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,090 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,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,103 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,105 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,105 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 359 transitions. cyclomatic complexity: 268 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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,158 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 359 transitions. cyclomatic complexity: 268. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 365 states and 1070 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,158 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,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-02-17 22:49:00,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:00,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:00,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:00,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 1070 transitions. [2025-02-17 22:49:00,164 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-02-17 22:49:00,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 205 states and 625 transitions. [2025-02-17 22:49:00,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2025-02-17 22:49:00,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2025-02-17 22:49:00,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 625 transitions. [2025-02-17 22:49:00,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 205 states and 625 transitions. [2025-02-17 22:49:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 625 transitions. [2025-02-17 22:49:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 171. [2025-02-17 22:49:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 171 states have (on average 3.181286549707602) internal successors, (544), 170 states have internal predecessors, (544), 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,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 544 transitions. [2025-02-17 22:49:00,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 171 states and 544 transitions. [2025-02-17 22:49:00,174 INFO L432 stractBuchiCegarLoop]: Abstraction has 171 states and 544 transitions. [2025-02-17 22:49:00,174 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:00,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 544 transitions. [2025-02-17 22:49:00,175 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-02-17 22:49:00,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:00,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:00,176 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[64] L12-->L32: 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]" "[67] L13-->L41: 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,176 INFO L754 eck$LassoCheckResult]: Loop: "[56] L41-->L43: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[58] L43-->L41: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:00,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash 90463, now seen corresponding path program 1 times [2025-02-17 22:49:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984316082] [2025-02-17 22:49:00,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,180 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,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,181 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,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2025-02-17 22:49:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365731780] [2025-02-17 22:49:00,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,187 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,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,190 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,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash 86936737, now seen corresponding path program 1 times [2025-02-17 22:49:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889405971] [2025-02-17 22:49:00,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,198 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,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,202 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,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,222 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,222 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,222 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,222 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,222 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,222 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,240 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,241 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,243 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,244 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,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,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,265 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,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,267 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,269 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,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,334 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,338 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,338 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,338 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,339 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,357 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,357 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,359 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,360 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,361 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,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,374 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,376 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:00,376 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:00,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,378 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,380 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,381 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,381 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,381 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,382 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-02-17 22:49:00,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:49:00,388 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,409 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,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,416 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,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,429 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,430 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,430 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 544 transitions. cyclomatic complexity: 407 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 544 transitions. cyclomatic complexity: 407. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 460 states and 1428 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,483 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,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-02-17 22:49:00,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:00,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:00,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:00,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 1428 transitions. [2025-02-17 22:49:00,488 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:00,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 0 states and 0 transitions. [2025-02-17 22:49:00,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:00,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:00,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:00,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:00,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,488 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,488 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:00,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:00,488 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:00,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:00,493 INFO L201 PluginConnector]: Adding new model indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:00 BoogieIcfgContainer [2025-02-17 22:49:00,494 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:00,494 INFO L158 Benchmark]: Toolchain (without parser) took 1908.14ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 84.9MB in the beginning and 67.0MB in the end (delta: 17.9MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,494 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.81ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,495 INFO L158 Benchmark]: Boogie Preprocessor took 13.71ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 83.0MB in the end (delta: 604.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,495 INFO L158 Benchmark]: RCFGBuilder took 156.49ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.5MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,495 INFO L158 Benchmark]: BuchiAutomizer took 1717.21ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.3MB in the beginning and 67.0MB in the end (delta: 7.3MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,496 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.22ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.81ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 13.71ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 83.0MB in the end (delta: 604.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 156.49ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.5MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1717.21ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.3MB in the beginning and 67.0MB in the end (delta: 7.3MB). Peak memory consumption was 18.1MB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 75 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 38 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 186, Trivial Ample Sets caused by loops: 116, Number of non-trivial ample sets: 117, Number of pruned transitions: 46, Number of transitions in reduction automaton: 261, Number of states in reduction automaton: 107, 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,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,908 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...