/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/indep_loops_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:33,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:33,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:33,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:33,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:33,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:33,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:33,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:33,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:33,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:33,423 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:33,423 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:33,423 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:33,423 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:33,423 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:33,423 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:33,423 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:33,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:33,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:33,423 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:33,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:33,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:33,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:33,424 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:33,425 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:33,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:33,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:33,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:33,699 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:33,699 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:33,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/indep_loops_3.c.bpl [2025-04-26 16:24:33,702 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/indep_loops_3.c.bpl' [2025-04-26 16:24:33,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:33,716 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:33,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:33,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:33,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:33,725 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,742 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,746 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:33,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:33,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:33,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:33,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:33,754 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,754 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,756 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,756 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,760 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,760 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,763 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,763 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,764 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 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:33,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:33,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:33,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:33,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:33" (1/1) ... [2025-04-26 16:24:33,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,799 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-04-26 16:24:33,803 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-04-26 16:24:33,824 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:33,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:33,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:33,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:33,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:33,826 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:33,861 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:33,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:33,920 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:33,921 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:33,928 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:33,928 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:33,929 INFO L201 PluginConnector]: Adding new model indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:33 BoogieIcfgContainer [2025-04-26 16:24:33,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:33,929 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:33,930 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:33,934 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:33,934 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:33,934 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:33" (1/2) ... [2025-04-26 16:24:33,935 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61044ff5 and model type indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:33, skipping insertion in model container [2025-04-26 16:24:33,935 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:33,935 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 26.04 04:24:33" (2/2) ... [2025-04-26 16:24:33,936 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_3.c.bpl [2025-04-26 16:24:33,981 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:34,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 71 flow [2025-04-26 16:24:34,034 INFO L116 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-04-26 16:24:34,035 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:34,039 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-04-26 16:24:34,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 25 transitions, 71 flow [2025-04-26 16:24:34,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 19 transitions, 56 flow [2025-04-26 16:24:34,046 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 19 transitions, 56 flow [2025-04-26 16:24:34,055 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:34,055 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:34,055 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:34,056 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:34,056 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:34,056 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:34,056 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:34,056 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:34,057 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:34,098 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:24:34,098 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:34,098 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:34,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:34,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:34,103 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:34,103 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 106 states, but on-demand construction may add more states [2025-04-26 16:24:34,108 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:24:34,108 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:34,108 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:34,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:34,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:34,112 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-04-26 16:24:34,113 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-04-26 16:24:34,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 1 times [2025-04-26 16:24:34,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707727901] [2025-04-26 16:24:34,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:34,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:34,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:34,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:34,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2025-04-26 16:24:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164108998] [2025-04-26 16:24:34,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash 89950, now seen corresponding path program 1 times [2025-04-26 16:24:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687929489] [2025-04-26 16:24:34,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:34,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:34,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:34,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:34,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,284 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,285 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,285 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,285 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,285 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:34,285 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,285 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,285 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,286 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:34,286 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,286 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,355 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,355 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:34,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,359 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-04-26 16:24:34,361 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-04-26 16:24:34,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:34,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,384 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-04-26 16:24:34,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:34,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:34,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,463 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:34,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,469 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,469 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,469 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,469 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,469 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:34,469 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,469 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,469 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,469 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:34,469 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,469 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,495 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,499 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:34,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:34,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:34,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:34,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:34,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:34,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:34,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:34,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:34,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:34,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:34,535 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:34,535 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:34,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,538 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:34,540 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:34,543 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-04-26 16:24:34,543 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:34,544 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:34,544 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:24:34,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:24:34,553 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:34,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:34,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:34,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:34,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:34,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:34,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:34,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:34,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:34,651 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:34,654 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 106 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,814 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 106 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 293 states and 938 transitions. Complement of second has 6 states. [2025-04-26 16:24:34,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 16:24:34,827 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:24:34,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,827 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:34,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,827 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:24:34,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 938 transitions. [2025-04-26 16:24:34,838 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 70 [2025-04-26 16:24:34,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 181 states and 585 transitions. [2025-04-26 16:24:34,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2025-04-26 16:24:34,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2025-04-26 16:24:34,881 INFO L74 IsDeterministic]: Start isDeterministic. Operand 181 states and 585 transitions. [2025-04-26 16:24:34,882 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:34,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 585 transitions. [2025-04-26 16:24:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 585 transitions. [2025-04-26 16:24:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 133. [2025-04-26 16:24:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 3.3157894736842106) internal successors, (in total 441), 132 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 441 transitions. [2025-04-26 16:24:34,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 441 transitions. [2025-04-26 16:24:34,911 INFO L438 stractBuchiCegarLoop]: Abstraction has 133 states and 441 transitions. [2025-04-26 16:24:34,911 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:34,911 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 441 transitions. [2025-04-26 16:24:34,913 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 70 [2025-04-26 16:24:34,914 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:34,914 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:34,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:34,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:34,915 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-04-26 16:24:34,915 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-04-26 16:24:34,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2916, now seen corresponding path program 1 times [2025-04-26 16:24:34,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340169378] [2025-04-26 16:24:34,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2627, now seen corresponding path program 1 times [2025-04-26 16:24:34,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255437659] [2025-04-26 16:24:34,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2803942, now seen corresponding path program 1 times [2025-04-26 16:24:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135639906] [2025-04-26 16:24:34,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:34,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:34,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:34,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:34,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,953 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,953 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,953 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,953 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,953 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:34,953 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,953 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,953 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:34,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,954 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,972 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,972 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:34,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,975 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:34,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:34,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,997 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-04-26 16:24:34,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:35,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:35,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,083 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:35,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:24:35,092 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:35,092 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:35,092 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:35,092 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:35,092 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:35,092 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,093 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:35,093 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:35,093 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:35,093 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:35,093 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:35,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,118 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:35,118 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:35,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:35,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:35,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:35,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:35,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:35,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:35,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:35,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:35,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:35,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:35,141 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:35,141 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:35,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,143 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:35,146 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:35,150 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:35,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:24:35,151 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:35,151 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:35,151 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:24:35,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:24:35,160 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:35,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:35,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:35,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,189 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:35,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:35,213 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:35,214 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 441 transitions. cyclomatic complexity: 347 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,290 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 441 transitions. cyclomatic complexity: 347. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 405 states and 1400 transitions. Complement of second has 6 states. [2025-04-26 16:24:35,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 16:24:35,292 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:35,292 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,292 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:35,292 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,292 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:35,292 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 1400 transitions. [2025-04-26 16:24:35,299 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-04-26 16:24:35,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 227 states and 787 transitions. [2025-04-26 16:24:35,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 16:24:35,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2025-04-26 16:24:35,306 INFO L74 IsDeterministic]: Start isDeterministic. Operand 227 states and 787 transitions. [2025-04-26 16:24:35,306 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:35,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 227 states and 787 transitions. [2025-04-26 16:24:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 787 transitions. [2025-04-26 16:24:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 186. [2025-04-26 16:24:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 3.629032258064516) internal successors, (in total 675), 185 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 675 transitions. [2025-04-26 16:24:35,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 675 transitions. [2025-04-26 16:24:35,319 INFO L438 stractBuchiCegarLoop]: Abstraction has 186 states and 675 transitions. [2025-04-26 16:24:35,319 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:35,319 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 675 transitions. [2025-04-26 16:24:35,322 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-04-26 16:24:35,322 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:35,322 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:35,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:35,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:35,323 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-04-26 16:24:35,323 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-04-26 16:24:35,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash 90463, now seen corresponding path program 1 times [2025-04-26 16:24:35,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991029425] [2025-04-26 16:24:35,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:35,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:35,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:35,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:35,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:35,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:35,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2025-04-26 16:24:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895199077] [2025-04-26 16:24:35,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:35,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:35,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 86936737, now seen corresponding path program 1 times [2025-04-26 16:24:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454319313] [2025-04-26 16:24:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:35,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:35,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:35,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:35,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:35,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:35,361 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:35,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:35,362 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:35,362 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:35,362 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:35,362 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,362 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:35,362 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:35,362 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:35,362 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:35,362 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:35,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,385 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:35,385 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:35,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:35,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:35,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:24:35,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:35,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:24:35,491 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:35,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:24:35,496 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:35,496 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:35,496 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:35,496 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:35,496 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:35,496 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,496 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:35,496 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:35,496 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:35,496 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:35,497 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:35,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,518 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:35,518 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:35,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:24:35,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:35,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:35,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:35,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:35,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:35,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:35,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:35,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:35,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:35,544 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:35,544 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:35,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,548 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:24:35,549 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:35,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:24:35,557 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:35,557 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:35,557 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:35,564 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-04-26 16:24:35,565 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:35,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:35,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:35,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:35,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:35,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,597 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:35,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:35,611 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:35,611 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 186 states and 675 transitions. cyclomatic complexity: 530 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,666 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 186 states and 675 transitions. cyclomatic complexity: 530. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 503 states and 1776 transitions. Complement of second has 6 states. [2025-04-26 16:24:35,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:24:35,667 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:35,667 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,667 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:35,667 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,667 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:35,667 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 1776 transitions. [2025-04-26 16:24:35,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:35,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 0 states and 0 transitions. [2025-04-26 16:24:35,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:35,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:35,672 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:35,672 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:35,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:35,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:35,672 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:35,672 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:35,672 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:35,673 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:35,673 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:35,682 INFO L201 PluginConnector]: Adding new model indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:35 BoogieIcfgContainer [2025-04-26 16:24:35,682 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:35,683 INFO L158 Benchmark]: Toolchain (without parser) took 1966.07ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 84.6MB in the beginning and 54.5MB in the end (delta: 30.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2025-04-26 16:24:35,683 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.91ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 85.4MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:35,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.46ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:35,683 INFO L158 Benchmark]: Boogie Preprocessor took 24.92ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 81.7MB in the end (delta: 997.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:35,683 INFO L158 Benchmark]: RCFGBuilder took 154.52ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 72.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:35,687 INFO L158 Benchmark]: BuchiAutomizer took 1752.56ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.9MB in the beginning and 54.5MB in the end (delta: 18.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2025-04-26 16:24:35,689 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.91ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 85.4MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.46ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.92ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 81.7MB in the end (delta: 997.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 154.52ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 72.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1752.56ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.9MB in the beginning and 54.5MB in the end (delta: 18.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 89 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, 81 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 39 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: 44ms 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.0s InitialAbstraction: - 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. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:35,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...