/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/4_plus_thr/m11.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:25:55,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:25:55,459 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:25:55,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:25:55,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:25:55,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:25:55,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:25:55,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:25:55,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:25:55,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:25:55,486 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:25:55,486 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:25:55,486 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:25:55,486 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:25:55,486 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:25:55,486 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:25:55,486 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:25:55,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:25:55,488 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:25:55,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:25:55,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:25:55,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:25:55,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:25:55,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:25:55,489 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:25:55,489 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:25:55,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:25:55,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:25:55,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:25:55,765 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:25:55,765 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:25:55,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m11.c.bpl [2025-04-26 16:25:55,768 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m11.c.bpl' [2025-04-26 16:25:55,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:25:55,789 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:25:55,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:55,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:25:55,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:25:55,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,824 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:25:55,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:55,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:25:55,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:25:55,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:25:55,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:25:55,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:25:55,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:25:55,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:25:55,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/1) ... [2025-04-26 16:25:55,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:55,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:55,885 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:25:55,889 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:25:55,912 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:25:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:25:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:25:55,912 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:25:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:25:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:25:55,912 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:25:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:25:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:25:55,912 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:25:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:25:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:25:55,913 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:25:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:25:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:25:55,913 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:25:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:25:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:25:55,913 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:25:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:25:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:25:55,914 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:25:55,957 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:25:55,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:25:56,079 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:25:56,080 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:25:56,094 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:25:56,094 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:25:56,095 INFO L201 PluginConnector]: Adding new model m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:56 BoogieIcfgContainer [2025-04-26 16:25:56,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:25:56,096 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:25:56,096 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:25:56,101 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:25:56,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:56,102 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:55" (1/2) ... [2025-04-26 16:25:56,103 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13a1aae8 and model type m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:25:56, skipping insertion in model container [2025-04-26 16:25:56,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:56,103 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:56" (2/2) ... [2025-04-26 16:25:56,104 INFO L376 chiAutomizerObserver]: Analyzing ICFG m11.c.bpl [2025-04-26 16:25:56,195 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:25:56,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 146 flow [2025-04-26 16:25:56,257 INFO L116 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-04-26 16:25:56,258 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:25:56,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 40 events. 6/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-04-26 16:25:56,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 52 transitions, 146 flow [2025-04-26 16:25:56,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 116 flow [2025-04-26 16:25:56,267 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 53 places, 40 transitions, 116 flow [2025-04-26 16:25:56,275 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:25:56,276 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:25:56,276 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:25:56,276 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:25:56,276 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:25:56,276 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:25:56,276 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:25:56,276 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:25:56,277 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:25:57,532 INFO L131 ngComponentsAnalysis]: Automaton has 2024 accepting balls. 9790 [2025-04-26 16:25:57,533 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:57,533 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:57,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:25:57,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:57,539 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:25:57,539 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 10153 states, but on-demand construction may add more states [2025-04-26 16:25:57,735 INFO L131 ngComponentsAnalysis]: Automaton has 2024 accepting balls. 9790 [2025-04-26 16:25:57,736 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:57,736 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:57,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:25:57,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:57,743 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:25:57,743 INFO L754 eck$LassoCheckResult]: Loop: "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[102] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 16:25:57,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:57,750 INFO L85 PathProgramCache]: Analyzing trace with hash 3878, now seen corresponding path program 1 times [2025-04-26 16:25:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:57,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987469587] [2025-04-26 16:25:57,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:57,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:57,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:57,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:57,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:57,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:57,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:57,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:57,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:57,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:57,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:57,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 1 times [2025-04-26 16:25:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:57,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225558511] [2025-04-26 16:25:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:57,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:57,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:57,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:57,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:57,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:57,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:57,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:57,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:57,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:57,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:57,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash 3729960, now seen corresponding path program 1 times [2025-04-26 16:25:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:57,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163519215] [2025-04-26 16:25:57,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:57,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:57,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:57,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:57,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:57,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:57,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:57,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:57,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:57,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:57,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:57,936 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:57,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:57,939 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:57,939 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:57,939 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:57,939 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:57,939 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:57,939 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:57,939 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:57,939 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:57,940 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:57,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:57,990 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:57,992 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:57,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:57,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:57,997 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:25:57,998 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:25:58,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:58,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:58,021 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:25:58,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:58,024 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:25:58,025 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:25:58,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:58,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:58,095 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:58,100 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:25:58,100 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:58,100 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:58,100 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:58,100 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:58,100 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:58,100 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:58,100 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:58,100 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:58,100 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:58,101 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:58,101 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:58,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:58,120 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:58,123 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:58,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:58,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:58,125 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:25:58,127 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:25:58,128 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:25:58,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:58,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:58,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:58,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:58,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:58,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:58,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:58,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:58,158 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:58,159 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:58,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:58,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:58,197 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:25:58,204 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:25:58,205 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:58,208 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:25:58,209 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:58,210 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:58,210 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x5) = 1*w - 1*x5 Supporting invariants [] [2025-04-26 16:25:58,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:58,230 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:58,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:58,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:58,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:58,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:58,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:58,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:58,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:58,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:58,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:58,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:58,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:58,320 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:58,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:58,343 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:25:58,388 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:25:58,393 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 10153 states, but on-demand construction may add more states 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:25:59,178 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 10153 states, but on-demand construction may add more states. 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 28322 states and 181109 transitions. Complement of second has 6 states. [2025-04-26 16:25:59,181 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:25:59,184 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:25:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-04-26 16:25:59,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:25:59,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:59,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:25:59,195 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:59,195 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:25:59,195 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:59,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28322 states and 181109 transitions. [2025-04-26 16:26:00,092 INFO L131 ngComponentsAnalysis]: Automaton has 2382 accepting balls. 9568 [2025-04-26 16:26:00,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28322 states to 21606 states and 139533 transitions. [2025-04-26 16:26:00,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9866 [2025-04-26 16:26:00,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15736 [2025-04-26 16:26:00,694 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21606 states and 139533 transitions. [2025-04-26 16:26:00,695 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:00,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21606 states and 139533 transitions. [2025-04-26 16:26:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21606 states and 139533 transitions. [2025-04-26 16:26:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21606 to 15738. [2025-04-26 16:26:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15738 states, 15738 states have (on average 6.64944719786504) internal successors, (in total 104649), 15737 states have internal predecessors, (104649), 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:26:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15738 states to 15738 states and 104649 transitions. [2025-04-26 16:26:01,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15738 states and 104649 transitions. [2025-04-26 16:26:01,911 INFO L438 stractBuchiCegarLoop]: Abstraction has 15738 states and 104649 transitions. [2025-04-26 16:26:01,911 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:26:01,911 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15738 states and 104649 transitions. [2025-04-26 16:26:02,062 INFO L131 ngComponentsAnalysis]: Automaton has 2382 accepting balls. 9568 [2025-04-26 16:26:02,063 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:02,063 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:02,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:26:02,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:02,064 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[130] L15-1-->L41: 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:26:02,064 INFO L754 eck$LassoCheckResult]: Loop: "[104] L41-->L43: Formula: (< v_x4_1 v_w_3) InVars {x4=v_x4_1, w=v_w_3} OutVars{x4=v_x4_1, w=v_w_3} AuxVars[] AssignedVars[]" "[106] L43-->L41: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:26:02,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash 120348, now seen corresponding path program 1 times [2025-04-26 16:26:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:02,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577314311] [2025-04-26 16:26:02,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:02,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:02,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:02,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:02,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:02,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:02,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:02,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,073 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 1 times [2025-04-26 16:26:02,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:02,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693120017] [2025-04-26 16:26:02,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:02,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:02,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:02,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:02,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:02,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,081 INFO L85 PathProgramCache]: Analyzing trace with hash 115657758, now seen corresponding path program 1 times [2025-04-26 16:26:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:02,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988721326] [2025-04-26 16:26:02,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:02,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:02,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:02,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:02,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:02,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:02,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:02,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:02,109 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:02,109 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:02,109 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:02,109 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:02,109 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:02,109 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,109 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:02,109 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:02,109 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:02,109 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:02,109 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:02,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:02,131 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:02,131 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:02,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,133 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:26:02,135 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:26:02,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:02,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:02,154 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:26:02,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,156 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:26:02,158 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:26:02,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:02,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:02,227 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:02,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:02,232 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:02,232 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:02,232 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:02,232 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:02,232 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:02,232 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,232 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:02,232 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:02,232 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:02,232 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:02,232 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:02,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:02,256 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:02,256 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:02,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,258 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:26:02,332 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:26:02,337 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:26:02,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:02,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:02,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:02,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:02,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:02,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:02,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:02,357 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:02,360 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:02,360 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:02,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,365 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:26:02,366 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:26:02,367 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:02,370 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:26:02,371 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:26:02,373 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:02,373 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:02,373 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x4) = 1*w - 1*x4 Supporting invariants [] [2025-04-26 16:26:02,385 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-04-26 16:26:02,389 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:02,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:02,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:02,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:02,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:02,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:02,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,435 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:02,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:02,463 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:26:02,464 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:26:02,465 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15738 states and 104649 transitions. cyclomatic complexity: 91825 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:26:03,867 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15738 states and 104649 transitions. cyclomatic complexity: 91825. 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 48332 states and 334313 transitions. Complement of second has 6 states. [2025-04-26 16:26:03,867 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:26:03,871 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:26:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-04-26 16:26:03,871 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:26:03,871 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:03,871 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:03,871 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:03,871 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:26:03,872 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:03,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48332 states and 334313 transitions. [2025-04-26 16:26:05,025 INFO L131 ngComponentsAnalysis]: Automaton has 2786 accepting balls. 9056 [2025-04-26 16:26:05,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48332 states to 36210 states and 252013 transitions. [2025-04-26 16:26:05,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12968 [2025-04-26 16:26:05,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19819 [2025-04-26 16:26:05,946 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36210 states and 252013 transitions. [2025-04-26 16:26:05,946 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:05,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36210 states and 252013 transitions. [2025-04-26 16:26:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36210 states and 252013 transitions. [2025-04-26 16:26:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36210 to 29359. [2025-04-26 16:26:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29359 states, 29359 states have (on average 7.243468782996696) internal successors, (in total 212661), 29358 states have internal predecessors, (212661), 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:26:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29359 states to 29359 states and 212661 transitions. [2025-04-26 16:26:07,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29359 states and 212661 transitions. [2025-04-26 16:26:07,557 INFO L438 stractBuchiCegarLoop]: Abstraction has 29359 states and 212661 transitions. [2025-04-26 16:26:07,557 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:26:07,557 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29359 states and 212661 transitions. [2025-04-26 16:26:08,013 INFO L131 ngComponentsAnalysis]: Automaton has 2786 accepting balls. 9056 [2025-04-26 16:26:08,014 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:08,014 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:08,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:26:08,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:08,015 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[130] L15-1-->L41: 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]" "[133] L16-->L50: 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:26:08,015 INFO L754 eck$LassoCheckResult]: Loop: "[108] L50-->L52: Formula: (< v_x2_1 v_w_5) InVars {x2=v_x2_1, w=v_w_5} OutVars{x2=v_x2_1, w=v_w_5} AuxVars[] AssignedVars[]" "[110] L52-->L50: 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:26:08,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash 3730921, now seen corresponding path program 1 times [2025-04-26 16:26:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:08,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728768131] [2025-04-26 16:26:08,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:08,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:08,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:08,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:08,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:08,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:08,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:08,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:08,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:08,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:08,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:08,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 4419, now seen corresponding path program 1 times [2025-04-26 16:26:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:08,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687898116] [2025-04-26 16:26:08,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:08,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:08,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:08,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:08,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:08,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:08,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:08,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:08,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:08,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:08,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:08,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:08,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -709548757, now seen corresponding path program 1 times [2025-04-26 16:26:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:08,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388334709] [2025-04-26 16:26:08,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:08,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:08,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:08,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:08,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:08,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:08,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:08,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:08,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:08,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:08,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:08,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:08,054 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:08,054 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:08,054 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:08,054 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:08,054 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:08,054 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:08,054 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:08,054 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:08,054 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:08,054 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:08,054 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:08,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:08,075 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:08,075 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:08,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:08,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:08,078 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:26:08,079 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:26:08,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:08,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:08,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:08,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:08,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:08,100 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:26:08,101 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:26:08,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:08,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:08,170 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:08,174 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:26:08,175 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:08,175 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:08,175 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:08,175 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:08,175 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:08,175 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:08,175 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:08,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:08,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:08,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:08,175 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:08,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:08,190 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:08,190 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:08,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:08,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:08,192 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:26:08,193 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:26:08,194 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:26:08,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:08,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:08,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:08,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:08,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:08,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:08,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:08,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:08,210 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:08,210 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:08,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:08,212 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:26:08,213 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:26:08,213 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:08,216 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:26:08,216 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:08,217 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:08,217 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-04-26 16:26:08,222 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:26:08,223 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:08,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:08,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:08,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:08,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:08,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:08,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:08,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:08,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:08,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:08,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:08,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:08,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:08,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:08,275 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:26:08,276 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:26:08,276 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29359 states and 212661 transitions. cyclomatic complexity: 187730 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:10,033 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29359 states and 212661 transitions. cyclomatic complexity: 187730. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 92713 states and 687130 transitions. Complement of second has 6 states. [2025-04-26 16:26:10,033 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:26:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-04-26 16:26:10,034 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:26:10,034 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:10,034 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:26:10,035 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:10,035 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:26:10,035 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:10,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92713 states and 687130 transitions. [2025-04-26 16:26:12,503 INFO L131 ngComponentsAnalysis]: Automaton has 3006 accepting balls. 8012 [2025-04-26 16:26:13,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92713 states to 66231 states and 491550 transitions. [2025-04-26 16:26:13,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18906 [2025-04-26 16:26:14,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25649 [2025-04-26 16:26:14,035 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66231 states and 491550 transitions. [2025-04-26 16:26:14,035 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:14,035 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66231 states and 491550 transitions. [2025-04-26 16:26:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66231 states and 491550 transitions. [2025-04-26 16:26:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66231 to 55709. [2025-04-26 16:26:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55709 states, 55709 states have (on average 7.686065088226319) internal successors, (in total 428183), 55708 states have internal predecessors, (428183), 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:26:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55709 states to 55709 states and 428183 transitions. [2025-04-26 16:26:16,922 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55709 states and 428183 transitions. [2025-04-26 16:26:16,922 INFO L438 stractBuchiCegarLoop]: Abstraction has 55709 states and 428183 transitions. [2025-04-26 16:26:16,922 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:26:16,922 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55709 states and 428183 transitions. [2025-04-26 16:26:17,806 INFO L131 ngComponentsAnalysis]: Automaton has 3006 accepting balls. 8012 [2025-04-26 16:26:17,806 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:17,806 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:17,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:26:17,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:17,808 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[130] L15-1-->L41: 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]" "[133] L16-->L50: 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]" "[136] L17-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:26:17,808 INFO L754 eck$LassoCheckResult]: Loop: "[112] L59-->L61: Formula: (< v_x3_1 v_w_7) InVars {w=v_w_7, x3=v_x3_1} OutVars{w=v_w_7, x3=v_x3_1} AuxVars[] AssignedVars[]" "[114] L61-->L59: 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:26:17,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash 115658687, now seen corresponding path program 1 times [2025-04-26 16:26:17,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:17,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037880484] [2025-04-26 16:26:17,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:17,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:17,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:17,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:17,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:17,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:17,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:17,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:17,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:17,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:17,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:17,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:17,826 INFO L85 PathProgramCache]: Analyzing trace with hash 4547, now seen corresponding path program 1 times [2025-04-26 16:26:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:17,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484688046] [2025-04-26 16:26:17,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:17,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:17,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:17,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:17,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:17,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:17,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:17,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:17,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:17,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:17,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:17,842 INFO L85 PathProgramCache]: Analyzing trace with hash -521147903, now seen corresponding path program 1 times [2025-04-26 16:26:17,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:17,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312456062] [2025-04-26 16:26:17,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:17,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:17,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:17,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:17,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:17,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:17,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:17,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:17,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:17,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:17,876 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:17,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:17,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:17,877 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:17,877 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:17,877 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:17,877 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:17,877 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:17,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:17,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:17,877 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:17,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:17,895 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:17,895 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:17,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:17,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:17,897 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:17,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:26:17,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:17,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:17,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:26:17,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:17,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:17,919 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:17,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:26:17,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:17,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:17,986 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:17,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:26:17,990 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:17,991 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:17,991 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:17,991 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:17,991 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:17,991 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:17,991 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:17,991 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:17,991 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:17,991 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:17,991 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:17,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:18,012 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:18,012 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:18,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:18,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:18,015 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:18,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:26:18,019 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:26:18,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:18,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:18,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:18,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:18,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:18,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:18,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:18,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:18,036 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:18,036 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:18,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:18,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:18,039 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:18,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:26:18,040 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:18,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:26:18,043 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:18,043 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:18,043 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x3) = 1*w - 1*x3 Supporting invariants [] [2025-04-26 16:26:18,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:18,049 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:18,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:18,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:18,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:18,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:18,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:18,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:18,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:18,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:18,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:18,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:18,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:18,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:18,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:18,098 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:26:18,099 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:26:18,099 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55709 states and 428183 transitions. cyclomatic complexity: 379266 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:26:21,717 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55709 states and 428183 transitions. cyclomatic complexity: 379266. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 167882 states and 1302513 transitions. Complement of second has 6 states. [2025-04-26 16:26:21,717 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:26:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:26:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-04-26 16:26:21,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:21,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:21,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:26:21,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:21,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:26:21,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:21,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167882 states and 1302513 transitions. [2025-04-26 16:26:26,685 INFO L131 ngComponentsAnalysis]: Automaton has 2644 accepting balls. 5970 [2025-04-26 16:26:29,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167882 states to 111294 states and 862097 transitions. [2025-04-26 16:26:29,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26764 [2025-04-26 16:26:29,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32760 [2025-04-26 16:26:29,428 INFO L74 IsDeterministic]: Start isDeterministic. Operand 111294 states and 862097 transitions. [2025-04-26 16:26:29,428 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:29,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111294 states and 862097 transitions. [2025-04-26 16:26:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111294 states and 862097 transitions. [2025-04-26 16:26:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111294 to 96600. [2025-04-26 16:26:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96600 states, 96600 states have (on average 7.971604554865425) internal successors, (in total 770057), 96599 states have internal predecessors, (770057), 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:26:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96600 states to 96600 states and 770057 transitions. [2025-04-26 16:26:34,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96600 states and 770057 transitions. [2025-04-26 16:26:34,180 INFO L438 stractBuchiCegarLoop]: Abstraction has 96600 states and 770057 transitions. [2025-04-26 16:26:34,180 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:26:34,180 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96600 states and 770057 transitions. [2025-04-26 16:26:35,417 INFO L131 ngComponentsAnalysis]: Automaton has 2644 accepting balls. 5970 [2025-04-26 16:26:35,417 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:35,417 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:35,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:26:35,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:35,420 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[130] L15-1-->L41: 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]" "[133] L16-->L50: 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]" "[136] L17-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" [2025-04-26 16:26:35,420 INFO L754 eck$LassoCheckResult]: Loop: "[116] L68-->L70: 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[]" "[118] L70-->L68: 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:26:35,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash -709547860, now seen corresponding path program 1 times [2025-04-26 16:26:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:35,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939443495] [2025-04-26 16:26:35,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:35,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:35,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:35,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:35,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:35,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:35,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:35,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:35,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:35,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:35,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:35,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2025-04-26 16:26:35,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:35,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509442659] [2025-04-26 16:26:35,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:35,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:35,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:35,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:35,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:35,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:35,433 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:35,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:35,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:35,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:35,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:35,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:35,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1024310318, now seen corresponding path program 1 times [2025-04-26 16:26:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:35,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420774837] [2025-04-26 16:26:35,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:35,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:35,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:35,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:35,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:35,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:35,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:35,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:35,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:35,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:35,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:35,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:35,463 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:35,463 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:35,463 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:35,463 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:35,463 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:35,463 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:35,463 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:35,463 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:35,463 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:26:35,463 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:35,463 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:35,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:35,482 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:35,482 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:35,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:35,485 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:35,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:26:35,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:35,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:35,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:26:35,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:35,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:35,508 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:35,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:26:35,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:35,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:35,574 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:35,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:26:35,578 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:35,578 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:35,578 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:35,578 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:35,578 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:35,578 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:35,578 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:35,578 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:35,578 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:26:35,578 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:35,578 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:35,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:35,594 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:35,594 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:35,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:35,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:35,596 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:35,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:26:35,598 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:26:35,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:35,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:35,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:35,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:35,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:35,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:35,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:35,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:35,612 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:35,612 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:35,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:35,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:35,614 INFO L229 MonitoredProcess]: Starting monitored process 21 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:26:35,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:26:35,617 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:35,620 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:35,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:35,621 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:35,621 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:35,621 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:26:35,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:26:35,628 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:35,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:35,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:35,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:35,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:35,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:35,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:35,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:35,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:35,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:35,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:35,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:35,664 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:35,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:35,676 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:26:35,676 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:26:35,676 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96600 states and 770057 transitions. cyclomatic complexity: 683411 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:26:42,045 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96600 states and 770057 transitions. cyclomatic complexity: 683411. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 323207 states and 2538730 transitions. Complement of second has 7 states. [2025-04-26 16:26:42,046 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:26:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:26:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-04-26 16:26:42,046 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:26:42,046 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:42,046 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:26:42,047 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:42,047 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:26:42,047 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:42,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323207 states and 2538730 transitions. [2025-04-26 16:26:50,569 INFO L131 ngComponentsAnalysis]: Automaton has 2047 accepting balls. 4776 [2025-04-26 16:26:54,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323207 states to 207736 states and 1639499 transitions. [2025-04-26 16:26:54,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48164 [2025-04-26 16:26:54,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52341 [2025-04-26 16:26:54,804 INFO L74 IsDeterministic]: Start isDeterministic. Operand 207736 states and 1639499 transitions. [2025-04-26 16:26:54,804 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:54,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 207736 states and 1639499 transitions. [2025-04-26 16:26:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207736 states and 1639499 transitions.