/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/m9.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:26:00,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:26:00,920 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:26:00,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:26:00,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:26:00,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:26:00,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:26:00,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:26:00,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:26:00,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:26:00,942 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:26:00,942 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:26:00,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:26:00,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:26:00,944 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:26:00,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:26:00,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:26:00,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:26:00,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:26:00,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:26:00,944 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:26:00,944 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:26:01,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:26:01,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:26:01,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:26:01,160 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:26:01,161 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:26:01,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m9.c.bpl [2025-04-26 16:26:01,163 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m9.c.bpl' [2025-04-26 16:26:01,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:26:01,176 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:26:01,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:01,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:26:01,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:26:01,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,209 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:26:01,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:01,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:26:01,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:26:01,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:26:01,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:26:01,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:26:01,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:26:01,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:26:01,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/1) ... [2025-04-26 16:26:01,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:01,261 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:26:01,264 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:26:01,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:26:01,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:26:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:26:01,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:26:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:26:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:26:01,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:26:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:26:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:26:01,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:26:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:26:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:26:01,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:26:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:26:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:26:01,284 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:26:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:26:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:26:01,284 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:26:01,323 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:26:01,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:26:01,416 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:26:01,416 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:26:01,424 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:26:01,424 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:26:01,426 INFO L201 PluginConnector]: Adding new model m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:01 BoogieIcfgContainer [2025-04-26 16:26:01,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:26:01,427 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:26:01,427 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:26:01,431 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:26:01,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:01,432 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:01" (1/2) ... [2025-04-26 16:26:01,433 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38ec05ed and model type m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:26:01, skipping insertion in model container [2025-04-26 16:26:01,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:01,433 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:01" (2/2) ... [2025-04-26 16:26:01,435 INFO L376 chiAutomizerObserver]: Analyzing ICFG m9.c.bpl [2025-04-26 16:26:01,497 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:26:01,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 123 flow [2025-04-26 16:26:01,553 INFO L116 PetriNetUnfolderBase]: 5/34 cut-off events. [2025-04-26 16:26:01,556 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:26:01,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 34 events. 5/34 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:26:01,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 123 flow [2025-04-26 16:26:01,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 98 flow [2025-04-26 16:26:01,566 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 45 places, 34 transitions, 98 flow [2025-04-26 16:26:01,573 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:26:01,573 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:26:01,573 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:26:01,574 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:26:01,574 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:26:01,574 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:26:01,574 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:26:01,574 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:26:01,575 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:26:01,882 INFO L131 ngComponentsAnalysis]: Automaton has 615 accepting balls. 2358 [2025-04-26 16:26:01,882 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:01,882 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:01,886 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:01,886 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:01,886 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:26:01,887 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2537 states, but on-demand construction may add more states [2025-04-26 16:26:01,957 INFO L131 ngComponentsAnalysis]: Automaton has 615 accepting balls. 2358 [2025-04-26 16:26:01,958 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:01,958 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:01,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:01,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:01,963 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:26:01,963 INFO L754 eck$LassoCheckResult]: Loop: "[85] L29-->L31: Formula: (< v_x4_1 v_w_1) InVars {x4=v_x4_1, w=v_w_1} OutVars{x4=v_x4_1, w=v_w_1} AuxVars[] AssignedVars[]" "[87] L31-->L29: 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:01,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:01,968 INFO L85 PathProgramCache]: Analyzing trace with hash 3549, now seen corresponding path program 1 times [2025-04-26 16:26:01,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:01,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429005051] [2025-04-26 16:26:01,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:02,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,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:02,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:02,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,035 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,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:02,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-04-26 16:26:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:02,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021911305] [2025-04-26 16:26:02,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:02,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:02,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,060 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,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:02,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,062 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,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [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 3413311, 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 [1791185611] [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 4 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 4 of 4 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,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:02,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:02,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:02,129 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:02,130 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:02,130 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:02,130 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:02,130 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:02,130 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,132 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:02,132 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:02,132 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:02,132 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:02,132 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:02,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:02,186 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:02,186 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:02,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,191 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:26:02,193 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:26:02,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:02,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:02,215 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:26:02,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,217 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:26:02,218 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:26:02,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:02,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:02,291 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:02,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:26:02,300 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:02,300 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:02,300 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:02,300 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:02,300 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:02,300 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,300 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:02,300 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:02,300 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:02,301 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:02,301 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:02,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:02,329 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:02,332 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:02,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,335 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:26:02,337 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:26:02,339 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,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:02,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:02,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:02,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:02,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:02,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:02,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:02,362 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:02,370 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:02,370 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:02,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,374 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:26:02,375 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:26:02,377 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:02,381 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:26:02,381 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:02,382 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:02,382 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x4) = 1*w - 1*x4 Supporting invariants [] [2025-04-26 16:26:02,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:26:02,396 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:02,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,436 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,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:02,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:02,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,454 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,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,454 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:02,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:02,478 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,541 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,544 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2537 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:26:02,811 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2537 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 7074 states and 37685 transitions. Complement of second has 6 states. [2025-04-26 16:26:02,815 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:02,819 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:26:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-04-26 16:26:02,828 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:26:02,828 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,829 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:26:02,829 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,829 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:26:02,829 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7074 states and 37685 transitions. [2025-04-26 16:26:02,980 INFO L131 ngComponentsAnalysis]: Automaton has 698 accepting balls. 2248 [2025-04-26 16:26:03,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7074 states to 5254 states and 28229 transitions. [2025-04-26 16:26:03,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2394 [2025-04-26 16:26:03,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3824 [2025-04-26 16:26:03,119 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5254 states and 28229 transitions. [2025-04-26 16:26:03,120 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:03,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5254 states and 28229 transitions. [2025-04-26 16:26:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states and 28229 transitions. [2025-04-26 16:26:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 3826. [2025-04-26 16:26:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3826 states, 3826 states have (on average 5.530841610036592) internal successors, (in total 21161), 3825 states have internal predecessors, (21161), 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,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 21161 transitions. [2025-04-26 16:26:03,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3826 states and 21161 transitions. [2025-04-26 16:26:03,351 INFO L438 stractBuchiCegarLoop]: Abstraction has 3826 states and 21161 transitions. [2025-04-26 16:26:03,351 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:26:03,351 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3826 states and 21161 transitions. [2025-04-26 16:26:03,424 INFO L131 ngComponentsAnalysis]: Automaton has 698 accepting balls. 2248 [2025-04-26 16:26:03,424 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:03,424 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:03,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:26:03,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:03,425 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L14-1-->L38: 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:03,425 INFO L754 eck$LassoCheckResult]: Loop: "[89] L38-->L40: Formula: (< v_x2_1 v_w_3) InVars {x2=v_x2_1, w=v_w_3} OutVars{x2=v_x2_1, w=v_w_3} AuxVars[] AssignedVars[]" "[91] L40-->L38: 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:03,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash 110130, now seen corresponding path program 1 times [2025-04-26 16:26:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933055242] [2025-04-26 16:26:03,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:03,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:03,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:03,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:03,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 3811, now seen corresponding path program 1 times [2025-04-26 16:26:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876675075] [2025-04-26 16:26:03,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 105837780, now seen corresponding path program 1 times [2025-04-26 16:26:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495393015] [2025-04-26 16:26:03,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:03,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:03,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:03,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:03,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,513 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,513 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,513 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,514 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,514 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:03,514 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,514 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,514 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,514 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:03,514 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,514 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,531 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,531 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:03,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,533 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:03,535 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:03,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:03,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:03,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,555 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:03,557 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:03,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:03,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,625 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:03,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:26:03,631 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,631 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,631 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,631 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,631 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:03,631 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,631 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,631 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,631 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:03,631 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,632 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,656 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,656 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:03,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,658 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:03,660 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:03,661 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:03,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:03,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:03,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:03,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:03,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:03,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:03,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:03,679 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:03,684 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:03,684 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:03,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,686 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:03,688 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:03,689 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:03,692 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:03,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:03,693 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:03,694 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:03,694 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, w) = -1*x2 + 1*w Supporting invariants [] [2025-04-26 16:26:03,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:26:03,702 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:03,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:03,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:03,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:03,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:03,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:03,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:03,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:03,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:03,751 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:03,752 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:03,752 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3826 states and 21161 transitions. cyclomatic complexity: 18202 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:04,046 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3826 states and 21161 transitions. cyclomatic complexity: 18202. 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 11784 states and 67893 transitions. Complement of second has 6 states. [2025-04-26 16:26:04,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:04,047 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:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 16:26:04,047 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:26:04,047 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,047 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:04,047 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,047 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:26:04,048 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11784 states and 67893 transitions. [2025-04-26 16:26:04,248 INFO L131 ngComponentsAnalysis]: Automaton has 750 accepting balls. 1996 [2025-04-26 16:26:04,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11784 states to 8566 states and 49533 transitions. [2025-04-26 16:26:04,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3068 [2025-04-26 16:26:04,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4687 [2025-04-26 16:26:04,479 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8566 states and 49533 transitions. [2025-04-26 16:26:04,479 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:04,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8566 states and 49533 transitions. [2025-04-26 16:26:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8566 states and 49533 transitions. [2025-04-26 16:26:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8566 to 6947. [2025-04-26 16:26:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6947 states, 6947 states have (on average 6.024039153591478) internal successors, (in total 41849), 6946 states have internal predecessors, (41849), 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:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6947 states to 6947 states and 41849 transitions. [2025-04-26 16:26:04,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6947 states and 41849 transitions. [2025-04-26 16:26:04,779 INFO L438 stractBuchiCegarLoop]: Abstraction has 6947 states and 41849 transitions. [2025-04-26 16:26:04,779 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:26:04,779 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6947 states and 41849 transitions. [2025-04-26 16:26:04,828 INFO L131 ngComponentsAnalysis]: Automaton has 750 accepting balls. 1996 [2025-04-26 16:26:04,828 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:04,828 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:04,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:26:04,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:04,829 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L14-1-->L38: 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]" "[114] L15-->L47: 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:04,829 INFO L754 eck$LassoCheckResult]: Loop: "[93] L47-->L49: Formula: (< v_x3_1 v_w_5) InVars {w=v_w_5, x3=v_x3_1} OutVars{w=v_w_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[95] L49-->L47: 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:04,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash 3414144, now seen corresponding path program 1 times [2025-04-26 16:26:04,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:04,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657121709] [2025-04-26 16:26:04,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:04,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:04,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:04,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:04,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:04,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:04,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:04,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-04-26 16:26:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:04,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902958759] [2025-04-26 16:26:04,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:04,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:04,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:04,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:04,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:04,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:04,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:04,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1013971934, now seen corresponding path program 1 times [2025-04-26 16:26:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:04,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845480181] [2025-04-26 16:26:04,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:04,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:04,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:04,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:04,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:04,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:04,884 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:04,885 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:04,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:04,885 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:04,885 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:04,885 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,885 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:04,885 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:04,885 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:04,885 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:04,885 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:04,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:04,903 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:04,903 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:04,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,905 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:04,907 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:04,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:04,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:04,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:26:04,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,927 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:04,927 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:04,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:04,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:04,999 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:05,003 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:05,004 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:05,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:05,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:05,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:05,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:05,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:05,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:05,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:05,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:05,004 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:05,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:05,025 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:05,025 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:05,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,027 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:05,029 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:05,030 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:05,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:05,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:05,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:05,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:05,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:05,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:05,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:05,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:05,046 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:05,046 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:05,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,049 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:05,050 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:05,051 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:05,054 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:05,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:05,056 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:05,057 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:05,057 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, w) = -1*x3 + 1*w Supporting invariants [] [2025-04-26 16:26:05,063 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:05,064 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:05,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:05,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:05,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:05,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:05,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:05,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:05,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:05,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:05,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:05,099 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:05,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:05,115 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:05,115 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:05,115 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6947 states and 41849 transitions. cyclomatic complexity: 36157 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:05,545 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6947 states and 41849 transitions. cyclomatic complexity: 36157. 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 21993 states and 135563 transitions. Complement of second has 6 states. [2025-04-26 16:26:05,545 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:05,546 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:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 16:26:05,546 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:26:05,546 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,547 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:26:05,547 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,547 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:26:05,547 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21993 states and 135563 transitions. [2025-04-26 16:26:05,952 INFO L131 ngComponentsAnalysis]: Automaton has 660 accepting balls. 1490 [2025-04-26 16:26:06,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21993 states to 14651 states and 90271 transitions. [2025-04-26 16:26:06,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4195 [2025-04-26 16:26:06,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5679 [2025-04-26 16:26:06,263 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14651 states and 90271 transitions. [2025-04-26 16:26:06,263 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:06,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14651 states and 90271 transitions. [2025-04-26 16:26:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14651 states and 90271 transitions. [2025-04-26 16:26:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14651 to 12335. [2025-04-26 16:26:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12335 states, 12335 states have (on average 6.3831374138629915) internal successors, (in total 78736), 12334 states have internal predecessors, (78736), 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:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12335 states to 12335 states and 78736 transitions. [2025-04-26 16:26:06,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12335 states and 78736 transitions. [2025-04-26 16:26:06,819 INFO L438 stractBuchiCegarLoop]: Abstraction has 12335 states and 78736 transitions. [2025-04-26 16:26:06,819 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:26:06,819 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12335 states and 78736 transitions. [2025-04-26 16:26:06,908 INFO L131 ngComponentsAnalysis]: Automaton has 660 accepting balls. 1490 [2025-04-26 16:26:06,909 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:06,909 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:06,909 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:26:06,909 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:06,910 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L14-1-->L38: 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]" "[114] L15-->L47: 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]" "[117] L16-->L56: 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:06,910 INFO L754 eck$LassoCheckResult]: Loop: "[97] L56-->L58: 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[]" "[99] L58-->L56: 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:06,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 105838581, now seen corresponding path program 1 times [2025-04-26 16:26:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:06,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837145012] [2025-04-26 16:26:06,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:06,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:06,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:06,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:06,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:06,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:06,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:06,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:06,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:06,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:26:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:06,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128315819] [2025-04-26 16:26:06,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:06,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:06,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:06,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:06,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:06,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:06,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:06,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:06,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:06,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:06,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1368335657, now seen corresponding path program 1 times [2025-04-26 16:26:06,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:06,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497331366] [2025-04-26 16:26:06,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:06,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:06,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:06,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:06,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:06,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:06,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:06,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:06,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:06,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:06,955 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:06,955 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:06,955 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:06,955 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:06,955 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:06,955 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,955 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:06,955 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:06,955 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:06,955 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:06,955 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:06,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:06,971 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:06,972 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:06,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:06,974 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:06,975 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:06,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:06,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:06,993 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:06,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:06,996 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:06,997 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:06,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:06,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:07,065 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:07,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:07,069 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:07,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:07,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:07,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:07,070 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:07,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:07,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:07,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:07,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:07,070 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:07,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:07,087 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:07,087 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:07,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:07,091 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:07,092 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:07,093 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:07,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:07,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:07,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:07,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:07,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:07,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:07,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:07,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:07,111 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:07,112 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:07,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:07,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:07,115 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:07,116 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:07,117 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:07,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:07,121 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:07,121 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:07,121 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:26:07,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:26:07,127 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:07,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:07,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:07,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:07,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:07,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:07,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:07,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:07,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:07,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:07,166 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:07,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:07,180 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:07,181 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:07,182 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12335 states and 78736 transitions. cyclomatic complexity: 68156 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:08,116 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12335 states and 78736 transitions. cyclomatic complexity: 68156. 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 42923 states and 270419 transitions. Complement of second has 7 states. [2025-04-26 16:26:08,116 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:08,117 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:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 16:26:08,117 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:08,117 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:08,117 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:26:08,117 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:08,117 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:26:08,117 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:08,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42923 states and 270419 transitions. [2025-04-26 16:26:09,030 INFO L131 ngComponentsAnalysis]: Automaton has 511 accepting balls. 1192 [2025-04-26 16:26:09,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42923 states to 27450 states and 174006 transitions. [2025-04-26 16:26:09,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7530 [2025-04-26 16:26:09,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8571 [2025-04-26 16:26:09,510 INFO L74 IsDeterministic]: Start isDeterministic. Operand 27450 states and 174006 transitions. [2025-04-26 16:26:09,510 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:09,510 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27450 states and 174006 transitions. [2025-04-26 16:26:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27450 states and 174006 transitions. [2025-04-26 16:26:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27450 to 21871. [2025-04-26 16:26:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21871 states, 21871 states have (on average 6.50829866032646) internal successors, (in total 142343), 21870 states have internal predecessors, (142343), 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,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21871 states to 21871 states and 142343 transitions. [2025-04-26 16:26:10,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21871 states and 142343 transitions. [2025-04-26 16:26:10,262 INFO L438 stractBuchiCegarLoop]: Abstraction has 21871 states and 142343 transitions. [2025-04-26 16:26:10,262 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:26:10,262 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21871 states and 142343 transitions. [2025-04-26 16:26:10,455 INFO L131 ngComponentsAnalysis]: Automaton has 511 accepting balls. 1192 [2025-04-26 16:26:10,455 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:10,455 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:10,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:26:10,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:10,456 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L14-1-->L38: 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]" "[114] L15-->L47: 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]" "[117] L16-->L56: 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]" "[96] L56-->L60: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[120] L17-->$Ultimate##0: 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]" "[101] $Ultimate##0-->L67-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 16:26:10,456 INFO L754 eck$LassoCheckResult]: Loop: "[103] L67-1-->L69: Formula: (< v_y_2 v_x1_6) InVars {y=v_y_2, x1=v_x1_6} OutVars{y=v_y_2, x1=v_x1_6} AuxVars[] AssignedVars[]" "[105] L69-->L67-1: Formula: (= (+ v_x1_7 1) v_x1_8) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-04-26 16:26:10,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 531267384, now seen corresponding path program 1 times [2025-04-26 16:26:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:10,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510606086] [2025-04-26 16:26:10,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:10,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:10,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:10,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:10,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:10,650 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:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:26:10,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510606086] [2025-04-26 16:26:10,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510606086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:26:10,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:26:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:26:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794752550] [2025-04-26 16:26:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:26:10,654 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:26:10,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 1 times [2025-04-26 16:26:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:10,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823616637] [2025-04-26 16:26:10,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:10,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:10,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:10,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:10,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:10,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:10,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:10,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:10,670 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:10,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:10,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:10,670 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:10,670 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:10,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:10,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:10,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:10,671 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:26:10,671 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:10,671 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:10,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:10,685 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:10,685 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:10,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:10,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:10,687 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:10,689 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:10,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:10,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:10,707 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:10,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:10,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:10,709 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:10,710 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:10,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:10,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:10,782 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:10,786 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:10,786 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:10,787 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:10,787 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:10,787 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:10,787 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:10,787 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:10,787 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:10,787 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:10,787 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:26:10,787 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:10,787 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:10,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:10,802 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:10,803 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:10,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:10,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:10,804 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:10,806 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:10,807 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:10,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:10,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:10,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:10,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:10,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:10,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:10,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:10,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:10,821 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:10,822 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:10,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:10,823 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:10,825 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:10,826 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:10,829 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:10,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:26:10,830 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:10,830 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:10,830 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 16:26:10,835 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:10,836 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:10,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:10,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:10,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:10,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:10,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:10,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:10,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:10,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:10,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:10,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:10,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:10,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:10,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:10,876 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:10,877 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:10,877 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21871 states and 142343 transitions. cyclomatic complexity: 123309 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:11,792 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21871 states and 142343 transitions. cyclomatic complexity: 123309. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 59212 states and 369905 transitions. Complement of second has 7 states. [2025-04-26 16:26:11,793 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:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-04-26 16:26:11,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:26:11,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:11,794 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:26:11,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:11,794 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:26:11,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:11,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59212 states and 369905 transitions. [2025-04-26 16:26:13,048 INFO L131 ngComponentsAnalysis]: Automaton has 511 accepting balls. 1192 [2025-04-26 16:26:13,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59212 states to 36445 states and 224803 transitions. [2025-04-26 16:26:13,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9441 [2025-04-26 16:26:13,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10035 [2025-04-26 16:26:13,610 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36445 states and 224803 transitions. [2025-04-26 16:26:13,610 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:13,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36445 states and 224803 transitions. [2025-04-26 16:26:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36445 states and 224803 transitions. [2025-04-26 16:26:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36445 to 24963. [2025-04-26 16:26:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24963 states, 24963 states have (on average 6.487561591154909) internal successors, (in total 161949), 24962 states have internal predecessors, (161949), 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:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24963 states to 24963 states and 161949 transitions. [2025-04-26 16:26:14,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24963 states and 161949 transitions. [2025-04-26 16:26:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:26:14,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:26:14,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:26:14,649 INFO L87 Difference]: Start difference. First operand 24963 states and 161949 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 2 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:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:26:14,752 INFO L93 Difference]: Finished difference Result 5973 states and 34307 transitions. [2025-04-26 16:26:14,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5973 states and 34307 transitions. [2025-04-26 16:26:14,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:14,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5973 states to 0 states and 0 transitions. [2025-04-26 16:26:14,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:26:14,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:26:14,833 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:26:14,833 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:26:14,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:14,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:14,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:26:14,835 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:14,835 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:26:14,835 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:26:14,835 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:14,835 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:26:14,841 INFO L201 PluginConnector]: Adding new model m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:26:14 BoogieIcfgContainer [2025-04-26 16:26:14,841 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:26:14,842 INFO L158 Benchmark]: Toolchain (without parser) took 13665.18ms. Allocated memory was 155.2MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 84.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-26 16:26:14,842 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 155.2MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:14,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.39ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:14,843 INFO L158 Benchmark]: Boogie Preprocessor took 27.87ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:26:14,844 INFO L158 Benchmark]: RCFGBuilder took 187.39ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 71.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:26:14,844 INFO L158 Benchmark]: BuchiAutomizer took 13413.69ms. Allocated memory was 155.2MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 71.0MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-26 16:26:14,845 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.76ms. Allocated memory is still 155.2MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.39ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.87ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 187.39ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 71.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 13413.69ms. Allocated memory was 155.2MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 71.0MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 2.9s AutomataMinimizationTime, 5 MinimizatonAttempts, 22424 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 4.6s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 209 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + w and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + w and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:26:14,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...