/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/m4_2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:44:00,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:44:00,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:44:00,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:44:00,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:44:00,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:44:00,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:44:00,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:44:00,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:44:00,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:44:00,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:44:00,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:44:00,628 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:44:00,628 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:44:00,628 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:44:00,628 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:44:00,628 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:44:00,628 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:44:00,628 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:44:00,628 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:44:00,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:44:00,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:44:00,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:00,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:44:00,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:44:00,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:44:00,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:44:00,630 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:44:00,630 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:44:00,630 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:44:00,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:44:00,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:44:00,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:44:00,867 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:44:00,868 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:44:00,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m4_2.c.bpl [2025-04-26 18:44:00,869 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m4_2.c.bpl' [2025-04-26 18:44:00,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:44:00,887 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:44:00,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:00,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:44:00,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:44:00,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,923 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:44:00,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:00,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:44:00,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:44:00,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:44:00,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:44:00,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:44:00,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:44:00,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:44:00,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/1) ... [2025-04-26 18:44:00,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:00,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:00,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:44:01,009 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:44:01,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:44:01,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:44:01,009 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:44:01,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:44:01,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:44:01,010 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:44:01,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:44:01,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:44:01,010 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:44:01,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:44:01,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:44:01,010 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:44:01,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:44:01,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:44:01,012 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 18:44:01,054 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:44:01,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:44:01,123 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:44:01,124 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:44:01,130 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:44:01,131 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:44:01,131 INFO L201 PluginConnector]: Adding new model m4_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:01 BoogieIcfgContainer [2025-04-26 18:44:01,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:44:01,132 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:44:01,132 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:44:01,136 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:44:01,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:01,136 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:00" (1/2) ... [2025-04-26 18:44:01,137 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2afd70f and model type m4_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:44:01, skipping insertion in model container [2025-04-26 18:44:01,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:01,137 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m4_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:01" (2/2) ... [2025-04-26 18:44:01,138 INFO L376 chiAutomizerObserver]: Analyzing ICFG m4_2.c.bpl [2025-04-26 18:44:01,196 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:44:01,239 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:44:01,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:44:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:01,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:44:01,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 18:44:01,312 INFO L116 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-04-26 18:44:01,313 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:44:01,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-04-26 18:44:01,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 18:44:01,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2025-04-26 18:44:01,320 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 30 transitions, 84 flow [2025-04-26 18:44:01,321 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 84 flow [2025-04-26 18:44:01,392 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 939 states, 938 states have (on average 3.9168443496801704) internal successors, (in total 3674), 938 states have internal predecessors, (3674), 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 18:44:01,394 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 939 states, 938 states have (on average 3.9168443496801704) internal successors, (in total 3674), 938 states have internal predecessors, (3674), 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 18:44:01,397 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:44:01,639 WARN L140 AmpleReduction]: Number of pruned transitions: 1372 [2025-04-26 18:44:01,639 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:44:01,639 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 218 [2025-04-26 18:44:01,640 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:40 [2025-04-26 18:44:01,641 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:510 [2025-04-26 18:44:01,641 WARN L145 AmpleReduction]: Times succ was already a loop node:470 [2025-04-26 18:44:01,641 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:52 [2025-04-26 18:44:01,641 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:44:01,643 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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 18:44:01,650 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:44:01,651 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:44:01,651 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:44:01,651 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:44:01,651 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:44:01,651 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:44:01,651 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:44:01,651 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:44:01,655 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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 18:44:01,709 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-04-26 18:44:01,710 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:01,710 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:01,716 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:01,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:01,716 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:44:01,719 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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 18:44:01,731 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-04-26 18:44:01,732 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:01,732 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:01,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:01,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:01,737 INFO L752 eck$LassoCheckResult]: Stem: "[69] $Ultimate##0-->L15: Formula: (and (= v_f1_4 0) (= v_f2_3 0)) InVars {f2=v_f2_3, f1=v_f1_4} OutVars{f2=v_f2_3, f1=v_f1_4} AuxVars[] AssignedVars[]" "[96] L15-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:44:01,738 INFO L754 eck$LassoCheckResult]: Loop: "[75] L28-->L30: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[77] L30-->L28: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:01,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 3196, now seen corresponding path program 1 times [2025-04-26 18:44:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:01,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080667201] [2025-04-26 18:44:01,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:01,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:01,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:01,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:01,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-04-26 18:44:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:01,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987244850] [2025-04-26 18:44:01,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:01,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:01,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:01,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:01,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:01,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:01,846 INFO L85 PathProgramCache]: Analyzing trace with hash 3073758, now seen corresponding path program 1 times [2025-04-26 18:44:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:01,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066923719] [2025-04-26 18:44:01,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:01,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:01,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:01,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:01,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:01,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:01,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:01,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:01,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:01,890 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:01,891 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:01,891 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:01,891 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:01,891 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:01,892 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,892 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:01,892 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:01,892 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:01,892 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:01,892 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:01,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:01,954 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:01,954 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:01,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,958 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 18:44:01,960 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 18:44:01,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:01,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:01,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:01,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:01,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,985 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 18:44:01,985 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 18:44:01,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:01,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,074 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:02,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:44:02,080 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:02,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:02,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:02,081 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:02,081 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:02,081 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,081 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:02,081 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:02,081 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:02,081 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:02,081 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:02,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,110 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:02,127 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:02,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,135 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 18:44:02,143 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 18:44:02,144 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 18:44:02,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:02,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:02,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:02,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:02,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:02,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:02,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:02,181 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:02,187 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:02,187 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:02,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,227 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 18:44:02,229 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 18:44:02,229 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:02,232 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 18:44:02,233 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:02,233 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:02,234 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 18:44:02,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:02,242 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:02,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:02,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:02,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:02,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:02,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:02,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:02,313 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 18:44:02,336 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:02,339 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:02,504 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2432 states and 5338 transitions. Complement of second has 7 states. [2025-04-26 18:44:02,505 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 18:44:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 18:44:02,515 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:44:02,516 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,516 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:44:02,516 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,516 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:44:02,516 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2432 states and 5338 transitions. [2025-04-26 18:44:02,552 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 534 [2025-04-26 18:44:02,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2432 states to 1708 states and 3875 transitions. [2025-04-26 18:44:02,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1159 [2025-04-26 18:44:02,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1374 [2025-04-26 18:44:02,582 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1708 states and 3875 transitions. [2025-04-26 18:44:02,583 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:02,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1708 states and 3875 transitions. [2025-04-26 18:44:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states and 3875 transitions. [2025-04-26 18:44:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1183. [2025-04-26 18:44:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1183 states have (on average 2.4133558748943362) internal successors, (in total 2855), 1182 states have internal predecessors, (2855), 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 18:44:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2855 transitions. [2025-04-26 18:44:02,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1183 states and 2855 transitions. [2025-04-26 18:44:02,672 INFO L438 stractBuchiCegarLoop]: Abstraction has 1183 states and 2855 transitions. [2025-04-26 18:44:02,672 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:44:02,672 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1183 states and 2855 transitions. [2025-04-26 18:44:02,679 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 468 [2025-04-26 18:44:02,679 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:02,679 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:02,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:44:02,680 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:02,680 INFO L752 eck$LassoCheckResult]: Stem: "[69] $Ultimate##0-->L15: Formula: (and (= v_f1_4 0) (= v_f2_3 0)) InVars {f2=v_f2_3, f1=v_f1_4} OutVars{f2=v_f2_3, f1=v_f1_4} AuxVars[] AssignedVars[]" "[96] L15-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L15-1-->$Ultimate##0: 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]" "[74] L28-->L32: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[76] L32-->thread1FINAL: Formula: (= v_f1_1 (+ v_f1_2 1)) InVars {f1=v_f1_2} OutVars{f1=v_f1_1} AuxVars[] AssignedVars[f1]" "[79] $Ultimate##0-->L39-1: Formula: (< 0 v_f1_3) InVars {f1=v_f1_3} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[]" [2025-04-26 18:44:02,680 INFO L754 eck$LassoCheckResult]: Loop: "[81] L39-1-->L41: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L41-->L39-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:02,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1340371322, now seen corresponding path program 1 times [2025-04-26 18:44:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014107129] [2025-04-26 18:44:02,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:02,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:02,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:02,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:02,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash 3555, now seen corresponding path program 1 times [2025-04-26 18:44:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830007103] [2025-04-26 18:44:02,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 393350952, now seen corresponding path program 1 times [2025-04-26 18:44:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855487345] [2025-04-26 18:44:02,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:02,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:02,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:02,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:02,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,732 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:02,732 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:02,732 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:02,732 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:02,732 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:02,733 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,733 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:02,733 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:02,733 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:02,733 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:02,733 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:02,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,752 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:02,752 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:02,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,755 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 18:44:02,756 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 18:44:02,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:02,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,775 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 18:44:02,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,777 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 18:44:02,778 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 18:44:02,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:02,779 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,859 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:02,864 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 18:44:02,864 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:02,864 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:02,865 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:02,865 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:02,865 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:02,865 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,865 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:02,865 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:02,865 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:02,865 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:02,865 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:02,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,886 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:02,886 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:02,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,888 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 18:44:02,890 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 18:44:02,891 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 18:44:02,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:02,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:02,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:02,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:02,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:02,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:02,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:02,904 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:02,906 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:02,907 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:02,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,909 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 18:44:02,911 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 18:44:02,912 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:02,916 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 18:44:02,916 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:02,916 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:02,916 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, x1) = -1*y1 + 1*x1 Supporting invariants [] [2025-04-26 18:44:02,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:02,924 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:02,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:02,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:02,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:02,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:02,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:02,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:02,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:02,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:02,971 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 18:44:02,972 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:02,972 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1183 states and 2855 transitions. cyclomatic complexity: 1885 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:03,064 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1183 states and 2855 transitions. cyclomatic complexity: 1885. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3339 states and 7927 transitions. Complement of second has 7 states. [2025-04-26 18:44:03,065 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 18:44:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 18:44:03,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:44:03,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:44:03,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:44:03,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3339 states and 7927 transitions. [2025-04-26 18:44:03,135 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 598 [2025-04-26 18:44:03,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3339 states to 2578 states and 6110 transitions. [2025-04-26 18:44:03,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1349 [2025-04-26 18:44:03,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1597 [2025-04-26 18:44:03,165 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2578 states and 6110 transitions. [2025-04-26 18:44:03,165 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:03,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2578 states and 6110 transitions. [2025-04-26 18:44:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states and 6110 transitions. [2025-04-26 18:44:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1800. [2025-04-26 18:44:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1800 states have (on average 2.5033333333333334) internal successors, (in total 4506), 1799 states have internal predecessors, (4506), 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 18:44:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 4506 transitions. [2025-04-26 18:44:03,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1800 states and 4506 transitions. [2025-04-26 18:44:03,210 INFO L438 stractBuchiCegarLoop]: Abstraction has 1800 states and 4506 transitions. [2025-04-26 18:44:03,210 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:44:03,210 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1800 states and 4506 transitions. [2025-04-26 18:44:03,219 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 532 [2025-04-26 18:44:03,220 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:03,220 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:03,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:03,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:03,220 INFO L752 eck$LassoCheckResult]: Stem: "[69] $Ultimate##0-->L15: Formula: (and (= v_f1_4 0) (= v_f2_3 0)) InVars {f2=v_f2_3, f1=v_f1_4} OutVars{f2=v_f2_3, f1=v_f1_4} AuxVars[] AssignedVars[]" "[96] L15-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L15-1-->$Ultimate##0: 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]" "[79] $Ultimate##0-->L39-1: Formula: (< 0 v_f1_3) InVars {f1=v_f1_3} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[]" "[81] L39-1-->L41: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L41-->L39-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[80] L39-1-->thread2FINAL: Formula: (<= v_x1_8 v_y1_2) InVars {y1=v_y1_2, x1=v_x1_8} OutVars{y1=v_y1_2, x1=v_x1_8} AuxVars[] AssignedVars[]" [2025-04-26 18:44:03,221 INFO L754 eck$LassoCheckResult]: Loop: "[75] L28-->L30: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[77] L30-->L28: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:03,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1398315942, now seen corresponding path program 1 times [2025-04-26 18:44:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020808743] [2025-04-26 18:44:03,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:03,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:03,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:44:03,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:03,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020808743] [2025-04-26 18:44:03,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020808743] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:03,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:03,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:44:03,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855654996] [2025-04-26 18:44:03,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:03,259 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:03,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 2 times [2025-04-26 18:44:03,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293534917] [2025-04-26 18:44:03,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:03,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,281 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,281 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,281 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,281 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:03,281 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,281 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,281 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:03,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,282 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,303 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,303 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:03,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,306 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 18:44:03,306 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 18:44:03,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:03,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,323 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 18:44:03,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,325 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 18:44:03,326 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 18:44:03,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:03,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,399 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:03,403 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 18:44:03,404 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,404 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,404 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,404 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,404 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:03,404 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,404 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,404 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,404 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:03,404 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,404 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,425 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,426 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:03,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,429 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 18:44:03,430 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 18:44:03,431 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 18:44:03,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:03,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:03,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:03,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:03,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:03,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:03,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:03,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:03,449 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:03,449 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:03,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,451 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 18:44:03,452 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 18:44:03,452 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:03,455 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 18:44:03,455 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:03,455 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:03,456 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-04-26 18:44:03,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:03,462 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:03,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:03,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:03,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,516 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 18:44:03,517 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:03,517 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1800 states and 4506 transitions. cyclomatic complexity: 3005 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 18:44:03,586 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1800 states and 4506 transitions. cyclomatic complexity: 3005. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 2752 states and 6853 transitions. Complement of second has 6 states. [2025-04-26 18:44:03,586 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 18:44:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 18:44:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 18:44:03,587 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:44:03,587 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,587 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:44:03,587 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,588 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:44:03,588 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2752 states and 6853 transitions. [2025-04-26 18:44:03,609 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 416 [2025-04-26 18:44:03,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2752 states to 2233 states and 5399 transitions. [2025-04-26 18:44:03,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1128 [2025-04-26 18:44:03,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1345 [2025-04-26 18:44:03,627 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2233 states and 5399 transitions. [2025-04-26 18:44:03,628 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:03,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2233 states and 5399 transitions. [2025-04-26 18:44:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states and 5399 transitions. [2025-04-26 18:44:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1768. [2025-04-26 18:44:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1768 states have (on average 2.535633484162896) internal successors, (in total 4483), 1767 states have internal predecessors, (4483), 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 18:44:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 4483 transitions. [2025-04-26 18:44:03,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1768 states and 4483 transitions. [2025-04-26 18:44:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:44:03,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:44:03,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:44:03,705 INFO L87 Difference]: Start difference. First operand 1768 states and 4483 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:44:03,729 INFO L93 Difference]: Finished difference Result 514 states and 1137 transitions. [2025-04-26 18:44:03,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 1137 transitions. [2025-04-26 18:44:03,731 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 18:44:03,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 477 states and 1063 transitions. [2025-04-26 18:44:03,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2025-04-26 18:44:03,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2025-04-26 18:44:03,736 INFO L74 IsDeterministic]: Start isDeterministic. Operand 477 states and 1063 transitions. [2025-04-26 18:44:03,736 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:03,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 18:44:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states and 1063 transitions. [2025-04-26 18:44:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-04-26 18:44:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 477 states have (on average 2.2285115303983227) internal successors, (in total 1063), 476 states have internal predecessors, (1063), 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 18:44:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1063 transitions. [2025-04-26 18:44:03,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 18:44:03,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:44:03,748 INFO L438 stractBuchiCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 18:44:03,748 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:03,748 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states and 1063 transitions. [2025-04-26 18:44:03,750 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 18:44:03,750 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:03,750 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:03,750 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:03,750 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:03,751 INFO L752 eck$LassoCheckResult]: Stem: "[69] $Ultimate##0-->L15: Formula: (and (= v_f1_4 0) (= v_f2_3 0)) InVars {f2=v_f2_3, f1=v_f1_4} OutVars{f2=v_f2_3, f1=v_f1_4} AuxVars[] AssignedVars[]" "[96] L15-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L15-1-->$Ultimate##0: 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]" "[102] L16-->L48: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[75] L28-->L30: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[105] L17-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[77] L30-->L28: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[84] L48-->L52: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[86] L52-->thread3FINAL: Formula: (= v_f2_1 (+ v_f2_2 1)) InVars {f2=v_f2_2} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[89] $Ultimate##0-->L59-1: Formula: (< 0 v_f2_4) InVars {f2=v_f2_4} OutVars{f2=v_f2_4} AuxVars[] AssignedVars[]" [2025-04-26 18:44:03,751 INFO L754 eck$LassoCheckResult]: Loop: "[91] L59-1-->L61: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[93] L61-->L59-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:03,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash -871290937, now seen corresponding path program 1 times [2025-04-26 18:44:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189372647] [2025-04-26 18:44:03,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:03,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:03,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:03,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:03,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,777 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 18:44:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803669806] [2025-04-26 18:44:03,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash 208035177, now seen corresponding path program 1 times [2025-04-26 18:44:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477927686] [2025-04-26 18:44:03,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:03,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:03,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:03,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:03,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,821 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,822 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,822 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,822 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:03,822 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,822 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,822 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,822 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:03,822 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,822 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,837 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,838 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:03,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,840 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 18:44:03,842 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 18:44:03,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:03,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:03,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,870 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 18:44:03,873 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 18:44:03,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:03,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,950 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:03,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:03,955 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,955 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,955 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,955 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,955 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:03,955 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,955 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,955 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,955 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:03,955 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,955 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,978 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,978 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:03,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,980 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 18:44:03,981 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 18:44:03,982 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 18:44:03,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:03,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:03,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:03,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:03,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:03,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:03,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:03,996 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:04,001 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:04,001 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:04,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,004 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 18:44:04,006 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 18:44:04,007 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:04,011 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 18:44:04,011 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:04,011 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:04,011 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 18:44:04,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,021 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:04,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:04,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:04,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,088 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 18:44:04,089 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:04,089 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 477 states and 1063 transitions. cyclomatic complexity: 670 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 18:44:04,150 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 477 states and 1063 transitions. cyclomatic complexity: 670. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 1357 states and 3075 transitions. Complement of second has 7 states. [2025-04-26 18:44:04,150 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 18:44:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 18:44:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 18:44:04,151 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:04,151 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,151 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:44:04,152 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,152 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:44:04,153 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1357 states and 3075 transitions. [2025-04-26 18:44:04,161 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 18:44:04,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1357 states to 742 states and 1678 transitions. [2025-04-26 18:44:04,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 325 [2025-04-26 18:44:04,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2025-04-26 18:44:04,167 INFO L74 IsDeterministic]: Start isDeterministic. Operand 742 states and 1678 transitions. [2025-04-26 18:44:04,167 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:04,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 742 states and 1678 transitions. [2025-04-26 18:44:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 1678 transitions. [2025-04-26 18:44:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 647. [2025-04-26 18:44:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 647 states have (on average 2.2302936630602783) internal successors, (in total 1443), 646 states have internal predecessors, (1443), 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 18:44:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1443 transitions. [2025-04-26 18:44:04,181 INFO L240 hiAutomatonCegarLoop]: Abstraction has 647 states and 1443 transitions. [2025-04-26 18:44:04,181 INFO L438 stractBuchiCegarLoop]: Abstraction has 647 states and 1443 transitions. [2025-04-26 18:44:04,181 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:04,181 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 647 states and 1443 transitions. [2025-04-26 18:44:04,183 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 18:44:04,183 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:04,183 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:04,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:04,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:04,184 INFO L752 eck$LassoCheckResult]: Stem: "[69] $Ultimate##0-->L15: Formula: (and (= v_f1_4 0) (= v_f2_3 0)) InVars {f2=v_f2_3, f1=v_f1_4} OutVars{f2=v_f2_3, f1=v_f1_4} AuxVars[] AssignedVars[]" "[96] L15-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L15-1-->$Ultimate##0: 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]" "[102] L16-->L48: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[74] L28-->L32: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[76] L32-->thread1FINAL: Formula: (= v_f1_1 (+ v_f1_2 1)) InVars {f1=v_f1_2} OutVars{f1=v_f1_1} AuxVars[] AssignedVars[f1]" "[79] $Ultimate##0-->L39-1: Formula: (< 0 v_f1_3) InVars {f1=v_f1_3} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[]" "[80] L39-1-->thread2FINAL: Formula: (<= v_x1_8 v_y1_2) InVars {y1=v_y1_2, x1=v_x1_8} OutVars{y1=v_y1_2, x1=v_x1_8} AuxVars[] AssignedVars[]" "[78] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[82] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:44:04,184 INFO L754 eck$LassoCheckResult]: Loop: "[85] L48-->L50: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[87] L50-->L48: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:04,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash -926646714, now seen corresponding path program 1 times [2025-04-26 18:44:04,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795964235] [2025-04-26 18:44:04,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:04,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:04,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:04,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:04,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:04,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:04,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-04-26 18:44:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975072368] [2025-04-26 18:44:04,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:04,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:04,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1449259160, now seen corresponding path program 1 times [2025-04-26 18:44:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465326302] [2025-04-26 18:44:04,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:04,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:04,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:04,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:44:04,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:44:04,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:04,233 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:04,233 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:04,233 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:04,233 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:04,233 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:04,233 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,233 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:04,233 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:04,233 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:04,233 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:04,233 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:04,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:04,252 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:04,252 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:04,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,255 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 18:44:04,257 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 18:44:04,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:04,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:04,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,281 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 18:44:04,283 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 18:44:04,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:04,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:04,353 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:04,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,358 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:04,359 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:04,359 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:04,359 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:04,359 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:04,359 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,359 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:04,359 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:04,359 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:04,359 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:04,359 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:04,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:04,376 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:04,376 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:04,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,379 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 18:44:04,381 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 18:44:04,382 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 18:44:04,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:04,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:04,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:04,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:04,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:04,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:04,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:04,396 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:04,400 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:04,400 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:04,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,403 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 18:44:04,405 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 18:44:04,407 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:04,410 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:04,411 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 18:44:04,411 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:04,411 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:04,411 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 18:44:04,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:04,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:04,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:04,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,452 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:04,464 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:04,464 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 647 states and 1443 transitions. cyclomatic complexity: 902 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 18:44:04,537 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 647 states and 1443 transitions. cyclomatic complexity: 902. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 799 states and 1727 transitions. Complement of second has 7 states. [2025-04-26 18:44:04,537 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 18:44:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 18:44:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 18:44:04,538 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:04,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,538 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:44:04,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,538 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:44:04,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 799 states and 1727 transitions. [2025-04-26 18:44:04,542 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 18:44:04,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 799 states to 720 states and 1566 transitions. [2025-04-26 18:44:04,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2025-04-26 18:44:04,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 325 [2025-04-26 18:44:04,546 INFO L74 IsDeterministic]: Start isDeterministic. Operand 720 states and 1566 transitions. [2025-04-26 18:44:04,546 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:04,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 720 states and 1566 transitions. [2025-04-26 18:44:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 1566 transitions. [2025-04-26 18:44:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 671. [2025-04-26 18:44:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 671 states have (on average 2.217585692995529) internal successors, (in total 1488), 670 states have internal predecessors, (1488), 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 18:44:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1488 transitions. [2025-04-26 18:44:04,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 671 states and 1488 transitions. [2025-04-26 18:44:04,558 INFO L438 stractBuchiCegarLoop]: Abstraction has 671 states and 1488 transitions. [2025-04-26 18:44:04,558 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:44:04,558 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 1488 transitions. [2025-04-26 18:44:04,560 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 18:44:04,560 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:04,560 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:04,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:04,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:04,561 INFO L752 eck$LassoCheckResult]: Stem: "[69] $Ultimate##0-->L15: Formula: (and (= v_f1_4 0) (= v_f2_3 0)) InVars {f2=v_f2_3, f1=v_f1_4} OutVars{f2=v_f2_3, f1=v_f1_4} AuxVars[] AssignedVars[]" "[96] L15-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L15-1-->$Ultimate##0: 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]" "[102] L16-->L48: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[75] L28-->L30: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[105] L17-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[77] L30-->L28: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[89] $Ultimate##0-->L59-1: Formula: (< 0 v_f2_4) InVars {f2=v_f2_4} OutVars{f2=v_f2_4} AuxVars[] AssignedVars[]" "[75] L28-->L30: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[90] L59-1-->thread4FINAL: Formula: (<= v_x2_8 v_y2_2) InVars {y2=v_y2_2, x2=v_x2_8} OutVars{y2=v_y2_2, x2=v_x2_8} AuxVars[] AssignedVars[]" [2025-04-26 18:44:04,561 INFO L754 eck$LassoCheckResult]: Loop: "[85] L48-->L50: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[87] L50-->L48: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:04,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -871286472, now seen corresponding path program 1 times [2025-04-26 18:44:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525552286] [2025-04-26 18:44:04,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:04,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:04,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,594 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 18:44:04,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:04,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525552286] [2025-04-26 18:44:04,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525552286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:04,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:44:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141477869] [2025-04-26 18:44:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:04,595 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:04,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,596 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2025-04-26 18:44:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986263122] [2025-04-26 18:44:04,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:04,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:04,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:04,614 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:04,614 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:04,614 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:04,614 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:04,614 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:04,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:04,614 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:04,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:04,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:04,614 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:04,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:04,628 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:04,628 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:04,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,630 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 18:44:04,631 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 18:44:04,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:04,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:04,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,654 INFO L229 MonitoredProcess]: Starting monitored process 24 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 18:44:04,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:44:04,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:04,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:04,725 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:04,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,730 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:04,730 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:04,730 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:04,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:04,730 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:04,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:04,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:04,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:04,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:04,730 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:04,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:04,749 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:04,749 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:04,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,751 INFO L229 MonitoredProcess]: Starting monitored process 25 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 18:44:04,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:44:04,754 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 18:44:04,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:04,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:04,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:04,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:04,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:04,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:04,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:04,769 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:04,772 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:04,772 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:04,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,779 INFO L229 MonitoredProcess]: Starting monitored process 26 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 18:44:04,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:44:04,781 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:04,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,786 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:04,786 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:04,786 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 18:44:04,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,794 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:04,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:04,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:04,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,851 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 18:44:04,851 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:04,852 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 671 states and 1488 transitions. cyclomatic complexity: 919 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 18:44:04,880 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 671 states and 1488 transitions. cyclomatic complexity: 919. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 929 states and 2038 transitions. Complement of second has 6 states. [2025-04-26 18:44:04,880 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 18:44:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 18:44:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-26 18:44:04,881 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:04,881 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,881 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:44:04,881 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,881 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:44:04,881 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 929 states and 2038 transitions. [2025-04-26 18:44:04,887 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 42 [2025-04-26 18:44:04,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 929 states to 590 states and 1282 transitions. [2025-04-26 18:44:04,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2025-04-26 18:44:04,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2025-04-26 18:44:04,891 INFO L74 IsDeterministic]: Start isDeterministic. Operand 590 states and 1282 transitions. [2025-04-26 18:44:04,891 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:04,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 590 states and 1282 transitions. [2025-04-26 18:44:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 1282 transitions. [2025-04-26 18:44:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-04-26 18:44:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 590 states have (on average 2.1728813559322036) internal successors, (in total 1282), 589 states have internal predecessors, (1282), 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 18:44:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1282 transitions. [2025-04-26 18:44:04,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 590 states and 1282 transitions. [2025-04-26 18:44:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:44:04,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:44:04,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:44:04,901 INFO L87 Difference]: Start difference. First operand 590 states and 1282 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:44:04,909 INFO L93 Difference]: Finished difference Result 120 states and 229 transitions. [2025-04-26 18:44:04,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 229 transitions. [2025-04-26 18:44:04,910 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:04,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 0 states and 0 transitions. [2025-04-26 18:44:04,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:44:04,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:44:04,910 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:44:04,910 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:44:04,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:04,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:04,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:44:04,912 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:04,912 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:44:04,912 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:44:04,912 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:04,912 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:44:04,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:44:04,929 INFO L201 PluginConnector]: Adding new model m4_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:44:04 BoogieIcfgContainer [2025-04-26 18:44:04,929 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:44:04,930 INFO L158 Benchmark]: Toolchain (without parser) took 4042.66ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 47.4MB in the end (delta: 39.6MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:04,931 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:04,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.10ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 84.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:04,933 INFO L158 Benchmark]: Boogie Preprocessor took 28.52ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:04,933 INFO L158 Benchmark]: RCFGBuilder took 176.08ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.0MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:44:04,933 INFO L158 Benchmark]: BuchiAutomizer took 3797.54ms. Allocated memory is still 159.4MB. Free memory was 74.0MB in the beginning and 47.4MB in the end (delta: 26.6MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. [2025-04-26 18:44:04,935 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.18ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.10ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 84.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.52ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 176.08ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.0MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3797.54ms. Allocated memory is still 159.4MB. Free memory was 74.0MB in the beginning and 47.4MB in the end (delta: 26.6MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1912 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 441 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 243 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 105ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 407, Number of transitions in reduction automaton: 1657, Number of states in reduction automaton: 769, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + x1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:44:04,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...