/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/2_thr/ie3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:19,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:19,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:19,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:19,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:19,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:19,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:19,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:19,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:19,611 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:19,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:19,611 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:19,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:19,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:19,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:19,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:19,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:19,616 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:19,616 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:19,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:19,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:19,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:19,841 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:19,842 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:19,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/ie3.c.bpl [2025-04-26 16:24:19,843 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/ie3.c.bpl' [2025-04-26 16:24:19,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:19,858 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:19,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:19,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:19,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:19,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,892 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:19,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:19,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:19,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:19,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:19,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:19,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:19,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:19,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:19,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/1) ... [2025-04-26 16:24:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:24:19,972 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:19,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:19,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:19,974 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:20,014 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:20,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:20,080 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:20,080 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:20,087 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:20,087 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:20,088 INFO L201 PluginConnector]: Adding new model ie3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:20 BoogieIcfgContainer [2025-04-26 16:24:20,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:20,089 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:20,089 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:20,092 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:20,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:20,093 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:19" (1/2) ... [2025-04-26 16:24:20,094 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12c698d6 and model type ie3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:20, skipping insertion in model container [2025-04-26 16:24:20,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:20,094 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:20" (2/2) ... [2025-04-26 16:24:20,095 INFO L376 chiAutomizerObserver]: Analyzing ICFG ie3.c.bpl [2025-04-26 16:24:20,148 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:20,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 78 flow [2025-04-26 16:24:20,208 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 16:24:20,210 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:20,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 16:24:20,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 78 flow [2025-04-26 16:24:20,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 68 flow [2025-04-26 16:24:20,218 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 31 places, 28 transitions, 68 flow [2025-04-26 16:24:20,226 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:20,226 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:20,226 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:20,226 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:20,226 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:20,226 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:20,226 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:20,226 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:20,227 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:20,260 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 96 [2025-04-26 16:24:20,261 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:20,261 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:20,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:20,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:20,263 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:20,263 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 123 states, but on-demand construction may add more states [2025-04-26 16:24:20,268 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 96 [2025-04-26 16:24:20,268 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:20,268 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:20,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:20,268 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:20,271 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_f_7 0) InVars {} OutVars{f=v_f_7} AuxVars[] AssignedVars[f]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:20,271 INFO L754 eck$LassoCheckResult]: Loop: "[71] L22-->L24: Formula: (< v_x1_1 v_z_2) InVars {x1=v_x1_1, z=v_z_2} OutVars{x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[73] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[75] L25-->L22: Formula: (= (+ v_c_2 1) v_c_1) InVars {c=v_c_2} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" [2025-04-26 16:24:20,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash 3101, now seen corresponding path program 1 times [2025-04-26 16:24:20,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:20,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318726662] [2025-04-26 16:24:20,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:20,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:20,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:20,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:20,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:20,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:20,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:20,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:20,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:20,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash 100360, now seen corresponding path program 1 times [2025-04-26 16:24:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:20,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473902437] [2025-04-26 16:24:20,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:20,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:20,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:20,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:20,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:20,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:20,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:20,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:20,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:20,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 92452460, now seen corresponding path program 1 times [2025-04-26 16:24:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:20,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135892005] [2025-04-26 16:24:20,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:20,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:20,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:20,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:20,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:20,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:20,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:20,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:20,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:20,439 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:20,440 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:20,440 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:20,440 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:20,440 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:20,440 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,440 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:20,440 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:20,440 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:20,440 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:20,440 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:20,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:20,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:20,508 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:20,508 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:20,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:20,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:20,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:20,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:20,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:20,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:24:20,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:20,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:20,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:20,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:20,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:20,576 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:20,576 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:24:20,582 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:24:20,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:20,585 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:20,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:20,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:20,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:20,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:20,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:20,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:20,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:20,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:20,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:20,685 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:20,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:20,691 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:20,691 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:20,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:20,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:20,691 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:20,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:20,691 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:20,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:20,691 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:20,691 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:20,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:20,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:20,737 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:20,740 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:20,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:20,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:20,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:20,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:20,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:20,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:20,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:20,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:20,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:20,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:20,765 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:20,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:24:20,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:20,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:20,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:20,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:20,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:20,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:20,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:20,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:20,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:20,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:20,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:20,790 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:20,793 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:20,793 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:20,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:20,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:20,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:20,820 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:20,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:20,823 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:20,823 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:20,824 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:20,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:24:20,834 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:20,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:20,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:20,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:20,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:20,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:20,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:20,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:20,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:20,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:20,879 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:20,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:20,980 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:20,982 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 123 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:21,108 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 123 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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 278 states and 622 transitions. Complement of second has 6 states. [2025-04-26 16:24:21,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-26 16:24:21,120 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:24:21,120 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,121 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:24:21,121 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,121 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:24:21,121 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 622 transitions. [2025-04-26 16:24:21,134 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 81 [2025-04-26 16:24:21,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 179 states and 406 transitions. [2025-04-26 16:24:21,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-04-26 16:24:21,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2025-04-26 16:24:21,144 INFO L74 IsDeterministic]: Start isDeterministic. Operand 179 states and 406 transitions. [2025-04-26 16:24:21,144 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:21,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 179 states and 406 transitions. [2025-04-26 16:24:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 406 transitions. [2025-04-26 16:24:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 157. [2025-04-26 16:24:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.248407643312102) internal successors, (in total 353), 156 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 353 transitions. [2025-04-26 16:24:21,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 353 transitions. [2025-04-26 16:24:21,178 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 353 transitions. [2025-04-26 16:24:21,178 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:21,178 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 353 transitions. [2025-04-26 16:24:21,184 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 81 [2025-04-26 16:24:21,184 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:21,184 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:21,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:21,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:21,185 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_f_7 0) InVars {} OutVars{f=v_f_7} AuxVars[] AssignedVars[f]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[97] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:24:21,185 INFO L754 eck$LassoCheckResult]: Loop: "[82] L39-->L41: Formula: (< v_x3_1 v_z_6) InVars {x3=v_x3_1, z=v_z_6} OutVars{x3=v_x3_1, z=v_z_6} AuxVars[] AssignedVars[]" "[84] L41-->L42: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[86] L42-->L39: Formula: (= v_c_7 (+ v_c_8 1)) InVars {c=v_c_8} OutVars{c=v_c_7} AuxVars[] AssignedVars[c]" [2025-04-26 16:24:21,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 96228, now seen corresponding path program 1 times [2025-04-26 16:24:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492971047] [2025-04-26 16:24:21,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash 111283, now seen corresponding path program 1 times [2025-04-26 16:24:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394448641] [2025-04-26 16:24:21,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:21,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,201 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1428157456, now seen corresponding path program 1 times [2025-04-26 16:24:21,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471664647] [2025-04-26 16:24:21,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:21,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:21,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:21,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,242 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:21,242 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:21,242 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:21,242 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:21,242 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:21,242 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,242 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:21,242 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:21,242 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:21,242 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:21,242 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:21,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,278 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:21,278 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:21,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:21,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:21,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:21,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:21,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:21,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:24:21,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:21,300 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:21,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:21,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:21,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:21,368 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:21,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:24:21,372 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:21,372 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:21,372 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:21,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:21,373 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:21,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:21,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:21,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:21,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:21,373 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:21,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,406 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:21,406 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:21,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:21,409 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:21,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:24:21,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:21,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:21,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:21,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:21,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:21,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:21,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:21,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:21,422 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:21,425 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:21,426 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:21,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:21,427 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:21,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:24:21,429 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:21,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:24:21,432 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:21,432 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:21,432 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:21,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:24:21,438 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:21,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:21,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:21,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:21,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:21,461 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:21,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:21,502 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:21,502 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 353 transitions. cyclomatic complexity: 226 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:24:21,567 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 353 transitions. cyclomatic complexity: 226. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 383 states and 922 transitions. Complement of second has 6 states. [2025-04-26 16:24:21,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:24:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-26 16:24:21,568 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:24:21,568 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,568 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:24:21,568 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,568 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:24:21,568 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 922 transitions. [2025-04-26 16:24:21,573 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 57 [2025-04-26 16:24:21,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 265 states and 631 transitions. [2025-04-26 16:24:21,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2025-04-26 16:24:21,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2025-04-26 16:24:21,577 INFO L74 IsDeterministic]: Start isDeterministic. Operand 265 states and 631 transitions. [2025-04-26 16:24:21,577 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:21,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 265 states and 631 transitions. [2025-04-26 16:24:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 631 transitions. [2025-04-26 16:24:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 227. [2025-04-26 16:24:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 227 states have (on average 2.4405286343612334) internal successors, (in total 554), 226 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 554 transitions. [2025-04-26 16:24:21,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 227 states and 554 transitions. [2025-04-26 16:24:21,595 INFO L438 stractBuchiCegarLoop]: Abstraction has 227 states and 554 transitions. [2025-04-26 16:24:21,596 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:21,596 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 554 transitions. [2025-04-26 16:24:21,597 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 57 [2025-04-26 16:24:21,597 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:21,597 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:21,597 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:21,597 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:21,598 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_f_7 0) InVars {} OutVars{f=v_f_7} AuxVars[] AssignedVars[f]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[70] L22-->L27: Formula: (<= v_z_3 v_x1_4) InVars {x1=v_x1_4, z=v_z_3} OutVars{x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[72] L27-->L28: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[74] L28-->L29-1: Formula: (<= 2 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:24:21,598 INFO L754 eck$LassoCheckResult]: Loop: "[77] L29-1-->L31: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[79] L31-->L32: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[80] L32-->L29-1: Formula: (= v_c_4 (+ v_c_3 1)) InVars {c=v_c_4} OutVars{c=v_c_3} AuxVars[] AssignedVars[c]" [2025-04-26 16:24:21,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash 92451467, now seen corresponding path program 1 times [2025-04-26 16:24:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645643822] [2025-04-26 16:24:21,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:21,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:21,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:21,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:21,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:21,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645643822] [2025-04-26 16:24:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645643822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:21,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500719330] [2025-04-26 16:24:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:21,649 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:21,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash 106317, now seen corresponding path program 1 times [2025-04-26 16:24:21,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561642701] [2025-04-26 16:24:21,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:21,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,679 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:21,679 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:21,679 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:21,679 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:21,679 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:21,679 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,679 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:21,679 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:21,679 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:21,679 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:21,679 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:21,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,708 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:21,708 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:21,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:21,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:21,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:24:21,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:21,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:21,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:24:21,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:21,731 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:24:21,732 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:24:21,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:21,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:21,799 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:21,803 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:24:21,803 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:21,804 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:21,804 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:21,804 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:21,804 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:21,804 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,804 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:21,804 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:21,804 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:21,804 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:21,804 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:21,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:21,836 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:21,836 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:21,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:21,838 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:24:21,840 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:24:21,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:21,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:21,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:21,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:21,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:21,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:21,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:21,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:21,854 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:21,856 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:21,856 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:21,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:21,858 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:24:21,859 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:24:21,860 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:21,863 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:24:21,863 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:21,863 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:21,863 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:24:21,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:24:21,869 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:21,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:21,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:21,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:21,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:21,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:21,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:21,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:21,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:21,897 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:21,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:21,931 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:21,932 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 227 states and 554 transitions. cyclomatic complexity: 363 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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:24:21,989 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 227 states and 554 transitions. cyclomatic complexity: 363. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 417 states and 1050 transitions. Complement of second has 6 states. [2025-04-26 16:24:21,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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:24:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 16:24:21,990 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:24:21,991 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,991 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:24:21,991 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,991 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:24:21,991 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:21,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 1050 transitions. [2025-04-26 16:24:21,995 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 33 [2025-04-26 16:24:21,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 305 states and 768 transitions. [2025-04-26 16:24:22,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2025-04-26 16:24:22,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2025-04-26 16:24:22,002 INFO L74 IsDeterministic]: Start isDeterministic. Operand 305 states and 768 transitions. [2025-04-26 16:24:22,002 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:22,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 305 states and 768 transitions. [2025-04-26 16:24:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states and 768 transitions. [2025-04-26 16:24:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 270. [2025-04-26 16:24:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 2.5703703703703704) internal successors, (in total 694), 269 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 694 transitions. [2025-04-26 16:24:22,011 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 694 transitions. [2025-04-26 16:24:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:22,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:24:22,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:24:22,013 INFO L87 Difference]: Start difference. First operand 270 states and 694 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:22,040 INFO L93 Difference]: Finished difference Result 136 states and 322 transitions. [2025-04-26 16:24:22,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 322 transitions. [2025-04-26 16:24:22,042 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:24:22,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 126 states and 295 transitions. [2025-04-26 16:24:22,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-04-26 16:24:22,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-04-26 16:24:22,043 INFO L74 IsDeterministic]: Start isDeterministic. Operand 126 states and 295 transitions. [2025-04-26 16:24:22,043 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:22,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 295 transitions. [2025-04-26 16:24:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 295 transitions. [2025-04-26 16:24:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-04-26 16:24:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 2.3412698412698414) internal successors, (in total 295), 125 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 295 transitions. [2025-04-26 16:24:22,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 295 transitions. [2025-04-26 16:24:22,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:24:22,049 INFO L438 stractBuchiCegarLoop]: Abstraction has 126 states and 295 transitions. [2025-04-26 16:24:22,049 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:22,049 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 295 transitions. [2025-04-26 16:24:22,050 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:24:22,050 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:22,050 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:22,050 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:22,050 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:22,050 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_f_7 0) InVars {} OutVars{f=v_f_7} AuxVars[] AssignedVars[f]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[97] L13-1-->L39: 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]" "[81] L39-->L44: Formula: (<= v_z_7 v_x3_4) InVars {x3=v_x3_4, z=v_z_7} OutVars{x3=v_x3_4, z=v_z_7} AuxVars[] AssignedVars[]" "[83] L44-->L45: Formula: (= v_f_4 (+ v_f_5 1)) InVars {f=v_f_5} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L22-->L27: Formula: (<= v_z_3 v_x1_4) InVars {x1=v_x1_4, z=v_z_3} OutVars{x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[72] L27-->L28: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[85] L45-->L46-1: Formula: (<= 2 v_f_6) InVars {f=v_f_6} OutVars{f=v_f_6} AuxVars[] AssignedVars[]" [2025-04-26 16:24:22,051 INFO L754 eck$LassoCheckResult]: Loop: "[88] L46-1-->L48: Formula: (< v_x4_2 v_z_8) InVars {x4=v_x4_2, z=v_z_8} OutVars{x4=v_x4_2, z=v_z_8} AuxVars[] AssignedVars[]" "[90] L48-->L49: Formula: (= v_x4_3 (+ v_x4_4 1)) InVars {x4=v_x4_4} OutVars{x4=v_x4_3} AuxVars[] AssignedVars[x4]" "[91] L49-->L46-1: Formula: (= (+ v_c_5 1) v_c_6) InVars {c=v_c_6} OutVars{c=v_c_5} AuxVars[] AssignedVars[c]" [2025-04-26 16:24:22,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1929253133, now seen corresponding path program 1 times [2025-04-26 16:24:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:22,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566086164] [2025-04-26 16:24:22,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:22,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:22,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:22,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:22,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:22,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:22,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:22,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:22,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:22,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:22,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash 117240, now seen corresponding path program 1 times [2025-04-26 16:24:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:22,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309393138] [2025-04-26 16:24:22,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:22,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:22,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:22,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:22,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:22,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:22,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:22,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:22,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:22,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:22,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -872182420, now seen corresponding path program 1 times [2025-04-26 16:24:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:22,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265739570] [2025-04-26 16:24:22,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:22,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:22,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:22,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:22,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:22,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:22,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:22,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:22,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:22,100 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:22,100 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:22,100 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:22,100 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:22,100 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:22,100 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,100 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:22,100 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:22,100 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:22,100 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:22,100 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:22,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,128 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:22,128 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:22,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,130 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:24:22,131 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:24:22,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:22,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:22,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:24:22,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,149 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:24:22,150 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:24:22,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:22,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:22,174 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:22,175 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=0}, {c=7}, {c=-8}] Lambdas: [0, 1, 1] Nus: [0, 0] [2025-04-26 16:24:22,180 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:24:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,183 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:24:22,185 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:24:22,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:22,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:22,202 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:24:22,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,204 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:24:22,205 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:24:22,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:22,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:22,270 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:22,275 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:24:22,275 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:22,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:22,277 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:22,277 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:22,277 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:22,277 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,277 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:22,277 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:22,277 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:22,277 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:22,277 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:22,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,315 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:22,315 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:22,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,317 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:24:22,319 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:24:22,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:22,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:22,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:22,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:22,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:22,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:22,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:22,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:22,334 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:22,339 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:24:22,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,342 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:22,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:24:22,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:22,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:22,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:22,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:22,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:22,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:22,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:22,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:22,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:22,358 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:22,358 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:22,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,360 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:22,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:24:22,361 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:22,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:24:22,364 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:22,364 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:22,365 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:24:22,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:24:22,371 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:22,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:22,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:22,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:22,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:22,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:22,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:22,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:22,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:22,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:22,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:22,405 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:22,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:22,432 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:22,432 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 126 states and 295 transitions. cyclomatic complexity: 188 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:22,463 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 126 states and 295 transitions. cyclomatic complexity: 188. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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 221 states and 531 transitions. Complement of second has 6 states. [2025-04-26 16:24:22,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 16:24:22,464 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:24:22,465 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:22,465 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:24:22,465 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:22,465 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 16:24:22,465 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:22,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 531 transitions. [2025-04-26 16:24:22,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:22,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 0 states and 0 transitions. [2025-04-26 16:24:22,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:22,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:22,467 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:22,467 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:22,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:22,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:22,467 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:22,467 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:22,467 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:22,467 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:22,467 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:22,474 INFO L201 PluginConnector]: Adding new model ie3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:22 BoogieIcfgContainer [2025-04-26 16:24:22,475 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:22,475 INFO L158 Benchmark]: Toolchain (without parser) took 2616.62ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.4MB in the beginning and 87.4MB in the end (delta: 65.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:22,476 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.68ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:22,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.84ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 85.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:22,476 INFO L158 Benchmark]: Boogie Preprocessor took 25.76ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 84.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:22,477 INFO L158 Benchmark]: RCFGBuilder took 166.50ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 75.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:22,477 INFO L158 Benchmark]: BuchiAutomizer took 2386.05ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.2MB in the beginning and 87.4MB in the end (delta: -12.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:22,478 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.68ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.84ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 85.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.76ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 84.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 166.50ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 75.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2386.05ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.2MB in the beginning and 87.4MB in the end (delta: -12.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 95 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 134 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:22,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...