/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 16:58:45,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:45,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:45,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:45,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:45,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:45,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:45,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:45,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:45,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:45,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:45,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:45,305 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:45,305 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:45,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:45,306 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:45,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:45,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:45,307 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:45,307 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:45,309 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:45,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:45,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:45,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:45,578 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:45,579 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:45,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m4_2.c.bpl [2025-04-26 16:58:45,581 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m4_2.c.bpl' [2025-04-26 16:58:45,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:45,598 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:45,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:45,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:45,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:45,608 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,629 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,634 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:45,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:45,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:45,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:45,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:45,642 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,642 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,644 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,644 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,645 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,646 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,651 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,651 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,652 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:45,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:45,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:45,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:45,663 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 04:58:45" (1/1) ... [2025-04-26 16:58:45,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:45,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,690 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 16:58:45,693 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 16:58:45,715 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:45,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:45,715 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:45,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:45,715 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:45,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:45,716 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:45,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:45,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:45,716 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:45,716 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:45,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:45,717 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:58:45,754 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:45,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:45,822 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:45,822 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:45,832 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:45,832 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:45,832 INFO L201 PluginConnector]: Adding new model m4_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:45 BoogieIcfgContainer [2025-04-26 16:58:45,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:45,833 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:45,833 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:45,837 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:45,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:45,838 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 04:58:45" (1/2) ... [2025-04-26 16:58:45,839 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f8f1f9 and model type m4_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:45, skipping insertion in model container [2025-04-26 16:58:45,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:45,839 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 04:58:45" (2/2) ... [2025-04-26 16:58:45,840 INFO L376 chiAutomizerObserver]: Analyzing ICFG m4_2.c.bpl [2025-04-26 16:58:45,899 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:58:45,939 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,942 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 16:58:45,943 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 16:58:46,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 16:58:46,029 INFO L116 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-04-26 16:58:46,031 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:58:46,038 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 16:58:46,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 16:58:46,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2025-04-26 16:58:46,041 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 30 transitions, 84 flow [2025-04-26 16:58:46,051 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:46,434 WARN L140 AmpleReduction]: Number of pruned transitions: 1372 [2025-04-26 16:58:46,435 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:46,435 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 218 [2025-04-26 16:58:46,435 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:40 [2025-04-26 16:58:46,435 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:510 [2025-04-26 16:58:46,435 WARN L145 AmpleReduction]: Times succ was already a loop node:470 [2025-04-26 16:58:46,435 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:50 [2025-04-26 16:58:46,435 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:46,439 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 16:58:46,450 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:46,450 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:46,450 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:46,450 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:46,450 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:46,450 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:46,450 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:46,450 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:46,455 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 16:58:46,498 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-04-26 16:58:46,498 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:46,498 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:46,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:46,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:46,504 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:46,505 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 16:58:46,516 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-04-26 16:58:46,516 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:46,516 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:46,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:46,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:46,522 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 16:58:46,522 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 16:58:46,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 3196, now seen corresponding path program 1 times [2025-04-26 16:58:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:46,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980563546] [2025-04-26 16:58:46,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:46,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:46,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:46,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:46,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:46,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:46,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:46,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:46,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:46,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:46,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:46,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:46,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-04-26 16:58:46,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:46,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038664130] [2025-04-26 16:58:46,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:46,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:46,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:46,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:46,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:46,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:46,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:46,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:46,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:46,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:46,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:46,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash 3073758, now seen corresponding path program 1 times [2025-04-26 16:58:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:46,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470932351] [2025-04-26 16:58:46,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:46,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:46,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:46,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:46,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:46,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:46,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:46,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:46,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:46,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:46,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:46,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:46,691 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:46,692 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:46,692 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:46,692 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:46,692 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:46,692 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,692 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:46,692 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:46,693 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:46,693 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:46,696 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:46,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:46,774 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:46,774 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:46,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:46,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:46,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:58:46,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:46,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:46,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:46,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:46,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:46,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:58:46,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:46,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:46,885 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:46,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:46,890 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:46,890 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:46,890 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:46,890 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:46,890 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:46,890 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,890 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:46,890 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:46,890 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:46,890 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:46,890 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:46,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:46,921 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:46,924 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:46,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:46,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:58:46,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:46,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:46,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:46,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:46,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:46,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:46,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:46,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:46,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:46,960 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:46,960 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:46,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:46,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:46,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:46,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:58:46,966 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:46,969 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:46,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:46,970 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:46,971 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:46,972 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:58:46,978 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 16:58:46,980 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:47,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:47,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:47,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:47,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:47,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:47,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:47,078 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:47,080 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 16:58:47,220 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 16:58:47,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 16:58:47,231 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:58:47,232 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,232 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:58:47,232 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,232 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:58:47,233 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2432 states and 5338 transitions. [2025-04-26 16:58:47,262 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 534 [2025-04-26 16:58:47,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2432 states to 1708 states and 3875 transitions. [2025-04-26 16:58:47,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1159 [2025-04-26 16:58:47,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1374 [2025-04-26 16:58:47,294 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1708 states and 3875 transitions. [2025-04-26 16:58:47,295 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:47,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1708 states and 3875 transitions. [2025-04-26 16:58:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states and 3875 transitions. [2025-04-26 16:58:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1183. [2025-04-26 16:58:47,377 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 16:58:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2855 transitions. [2025-04-26 16:58:47,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1183 states and 2855 transitions. [2025-04-26 16:58:47,384 INFO L438 stractBuchiCegarLoop]: Abstraction has 1183 states and 2855 transitions. [2025-04-26 16:58:47,384 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:47,384 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1183 states and 2855 transitions. [2025-04-26 16:58:47,391 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 468 [2025-04-26 16:58:47,391 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:47,391 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:47,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:58:47,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:47,392 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 16:58:47,392 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 16:58:47,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1340371322, now seen corresponding path program 1 times [2025-04-26 16:58:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:47,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459909983] [2025-04-26 16:58:47,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:47,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:47,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:47,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:47,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:47,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:47,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash 3555, now seen corresponding path program 1 times [2025-04-26 16:58:47,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:47,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972833786] [2025-04-26 16:58:47,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:47,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,413 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:47,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:47,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 393350952, now seen corresponding path program 1 times [2025-04-26 16:58:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:47,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602863925] [2025-04-26 16:58:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:47,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:47,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:47,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:47,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:47,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:47,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:47,455 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:47,455 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:47,455 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:47,455 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:47,455 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:47,455 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:47,455 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:47,455 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:47,455 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:47,456 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:47,458 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:47,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:47,481 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:47,481 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:47,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:47,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:47,485 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:47,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:58:47,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:47,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:47,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:47,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:47,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:47,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:47,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:58:47,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:47,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:47,583 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:47,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:58:47,588 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:47,588 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:47,588 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:47,588 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:47,588 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:47,588 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:47,588 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:47,588 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:47,588 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:47,588 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:47,588 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:47,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:47,611 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:47,611 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:47,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:47,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:47,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:47,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:58:47,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:47,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:47,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:47,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:47,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:47,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:47,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:47,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:47,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:47,632 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:47,632 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:47,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:47,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:47,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:58:47,637 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:47,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:47,642 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:47,642 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:47,642 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, x1) = -1*y1 + 1*x1 Supporting invariants [] [2025-04-26 16:58:47,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:58:47,648 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:47,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:47,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:47,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:47,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:47,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:47,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:47,686 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:47,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:47,703 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:47,703 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 16:58:47,811 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 16:58:47,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:58:47,812 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:58:47,812 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,812 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:58:47,812 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,812 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:58:47,812 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3339 states and 7927 transitions. [2025-04-26 16:58:47,842 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 598 [2025-04-26 16:58:47,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3339 states to 2578 states and 6110 transitions. [2025-04-26 16:58:47,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1349 [2025-04-26 16:58:47,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1597 [2025-04-26 16:58:47,864 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2578 states and 6110 transitions. [2025-04-26 16:58:47,864 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:47,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2578 states and 6110 transitions. [2025-04-26 16:58:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states and 6110 transitions. [2025-04-26 16:58:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1800. [2025-04-26 16:58:47,915 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 16:58:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 4506 transitions. [2025-04-26 16:58:47,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1800 states and 4506 transitions. [2025-04-26 16:58:47,921 INFO L438 stractBuchiCegarLoop]: Abstraction has 1800 states and 4506 transitions. [2025-04-26 16:58:47,922 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:47,922 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1800 states and 4506 transitions. [2025-04-26 16:58:47,930 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 532 [2025-04-26 16:58:47,931 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:47,931 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:47,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:47,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:47,932 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 16:58:47,932 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 16:58:47,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1398315942, now seen corresponding path program 1 times [2025-04-26 16:58:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:47,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247479507] [2025-04-26 16:58:47,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:47,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:47,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:47,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:47,969 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 16:58:47,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:47,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247479507] [2025-04-26 16:58:47,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247479507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:47,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:47,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730491237] [2025-04-26 16:58:47,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:47,973 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:58:47,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 2 times [2025-04-26 16:58:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:47,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767206706] [2025-04-26 16:58:47,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:58:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:47,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:58:47,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:47,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:47,996 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:47,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:47,996 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:47,996 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:47,996 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:47,996 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:47,996 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:47,996 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:47,996 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:47,996 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:47,996 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:47,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,009 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,010 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:48,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,012 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:58:48,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:48,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:58:48,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:48,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,101 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:48,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,105 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,105 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,105 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,105 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:48,105 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,105 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,105 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,105 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:48,105 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,106 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,121 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,121 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:48,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,123 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:58:48,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:48,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:48,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:48,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:48,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:48,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:48,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:48,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:48,138 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:48,141 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:48,141 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:48,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,143 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:58:48,146 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:48,149 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:48,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:58:48,150 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:48,150 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:48,150 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-04-26 16:58:48,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,162 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:48,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:48,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:48,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:48,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:48,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,195 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:48,210 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:48,210 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 16:58:48,282 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 16:58:48,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:48,283 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 16:58:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 16:58:48,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:58:48,284 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:58:48,284 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:58:48,284 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2752 states and 6853 transitions. [2025-04-26 16:58:48,324 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 416 [2025-04-26 16:58:48,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2752 states to 2233 states and 5399 transitions. [2025-04-26 16:58:48,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1128 [2025-04-26 16:58:48,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1345 [2025-04-26 16:58:48,343 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2233 states and 5399 transitions. [2025-04-26 16:58:48,343 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:48,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2233 states and 5399 transitions. [2025-04-26 16:58:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states and 5399 transitions. [2025-04-26 16:58:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1768. [2025-04-26 16:58:48,376 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 16:58:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 4483 transitions. [2025-04-26 16:58:48,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1768 states and 4483 transitions. [2025-04-26 16:58:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:48,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:48,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:48,386 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 16:58:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:48,413 INFO L93 Difference]: Finished difference Result 514 states and 1137 transitions. [2025-04-26 16:58:48,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 1137 transitions. [2025-04-26 16:58:48,417 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 16:58:48,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 477 states and 1063 transitions. [2025-04-26 16:58:48,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2025-04-26 16:58:48,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2025-04-26 16:58:48,420 INFO L74 IsDeterministic]: Start isDeterministic. Operand 477 states and 1063 transitions. [2025-04-26 16:58:48,421 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:48,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 16:58:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states and 1063 transitions. [2025-04-26 16:58:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-04-26 16:58:48,427 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 16:58:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1063 transitions. [2025-04-26 16:58:48,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 16:58:48,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:48,430 INFO L438 stractBuchiCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 16:58:48,430 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:48,431 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states and 1063 transitions. [2025-04-26 16:58:48,432 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 16:58:48,432 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:48,432 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:48,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:48,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:48,433 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 16:58:48,433 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 16:58:48,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash -871290937, now seen corresponding path program 1 times [2025-04-26 16:58:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102575474] [2025-04-26 16:58:48,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:48,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:48,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,443 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:48,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:48,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 16:58:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973986672] [2025-04-26 16:58:48,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:48,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:48,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:48,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:48,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 208035177, now seen corresponding path program 1 times [2025-04-26 16:58:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750619832] [2025-04-26 16:58:48,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:48,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:48,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,462 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,485 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,485 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,485 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,485 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,485 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:48,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,485 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,486 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,486 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:48,486 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,486 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,500 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,500 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:48,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,502 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:58:48,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:48,505 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,522 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:58:48,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:48,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,592 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:48,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:58:48,596 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:48,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:48,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,596 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,615 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,615 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:48,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,617 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:58:48,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:48,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:48,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:48,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:48,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:48,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:48,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:48,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:48,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:48,637 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:48,637 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:48,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,640 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:58:48,642 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:48,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:58:48,645 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:48,645 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:48,645 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 16:58:48,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,652 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:48,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:48,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:48,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:48,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:48,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:48,705 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:48,705 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 16:58:48,753 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 16:58:48,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:48,754 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 16:58:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 16:58:48,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:48,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:58:48,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:48,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1357 states and 3075 transitions. [2025-04-26 16:58:48,763 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 16:58:48,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1357 states to 742 states and 1678 transitions. [2025-04-26 16:58:48,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 325 [2025-04-26 16:58:48,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2025-04-26 16:58:48,768 INFO L74 IsDeterministic]: Start isDeterministic. Operand 742 states and 1678 transitions. [2025-04-26 16:58:48,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:48,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 742 states and 1678 transitions. [2025-04-26 16:58:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 1678 transitions. [2025-04-26 16:58:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 647. [2025-04-26 16:58:48,778 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 16:58:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1443 transitions. [2025-04-26 16:58:48,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 647 states and 1443 transitions. [2025-04-26 16:58:48,780 INFO L438 stractBuchiCegarLoop]: Abstraction has 647 states and 1443 transitions. [2025-04-26 16:58:48,780 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:48,780 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 647 states and 1443 transitions. [2025-04-26 16:58:48,783 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 16:58:48,783 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:48,783 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:48,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:48,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:48,783 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 16:58:48,783 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 16:58:48,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,784 INFO L85 PathProgramCache]: Analyzing trace with hash -871286472, now seen corresponding path program 1 times [2025-04-26 16:58:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425769805] [2025-04-26 16:58:48,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:48,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:48,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:48,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425769805] [2025-04-26 16:58:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425769805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:48,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:48,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450720956] [2025-04-26 16:58:48,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:48,828 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:58:48,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-04-26 16:58:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362859862] [2025-04-26 16:58:48,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:48,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:48,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:48,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:48,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,846 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,847 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,847 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,847 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,847 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:48,847 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,847 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,847 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,847 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:48,847 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,847 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,862 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,862 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:48,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,865 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:58:48,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:48,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,884 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 16:58:48,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,887 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:58:48,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:48,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,954 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:48,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:58:48,959 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:48,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:48,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,959 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,975 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,975 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:48,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,977 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:58:48,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:48,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:48,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:48,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:48,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:48,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:48,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:48,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:48,996 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:49,000 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:49,000 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:49,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:49,002 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:49,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:58:49,005 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:49,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:49,009 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:49,009 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:49,009 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:58:49,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:58:49,016 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:49,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:49,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:49,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:49,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:49,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:49,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:49,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:49,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:49,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:49,056 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:49,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:49,067 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:49,067 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 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 16:58:49,096 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 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 940 states and 2080 transitions. Complement of second has 6 states. [2025-04-26 16:58:49,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:49,097 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 16:58:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-26 16:58:49,097 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:49,097 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,097 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:58:49,097 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,097 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:49,097 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 940 states and 2080 transitions. [2025-04-26 16:58:49,102 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 46 [2025-04-26 16:58:49,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 940 states to 554 states and 1207 transitions. [2025-04-26 16:58:49,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-04-26 16:58:49,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2025-04-26 16:58:49,105 INFO L74 IsDeterministic]: Start isDeterministic. Operand 554 states and 1207 transitions. [2025-04-26 16:58:49,105 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:49,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 554 states and 1207 transitions. [2025-04-26 16:58:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states and 1207 transitions. [2025-04-26 16:58:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-04-26 16:58:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 554 states have (on average 2.17870036101083) internal successors, (in total 1207), 553 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1207 transitions. [2025-04-26 16:58:49,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 554 states and 1207 transitions. [2025-04-26 16:58:49,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:49,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:49,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:49,114 INFO L87 Difference]: Start difference. First operand 554 states and 1207 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 16:58:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:49,120 INFO L93 Difference]: Finished difference Result 100 states and 196 transitions. [2025-04-26 16:58:49,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 196 transitions. [2025-04-26 16:58:49,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 16:58:49,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 196 transitions. [2025-04-26 16:58:49,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 16:58:49,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 16:58:49,121 INFO L74 IsDeterministic]: Start isDeterministic. Operand 100 states and 196 transitions. [2025-04-26 16:58:49,121 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:49,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 196 transitions. [2025-04-26 16:58:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 196 transitions. [2025-04-26 16:58:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-26 16:58:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.96) internal successors, (in total 196), 99 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 196 transitions. [2025-04-26 16:58:49,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 196 transitions. [2025-04-26 16:58:49,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:49,123 INFO L438 stractBuchiCegarLoop]: Abstraction has 100 states and 196 transitions. [2025-04-26 16:58:49,123 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:58:49,124 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 196 transitions. [2025-04-26 16:58:49,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 16:58:49,124 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:49,124 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:49,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:49,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:49,125 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 16:58:49,125 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 16:58:49,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:49,125 INFO L85 PathProgramCache]: Analyzing trace with hash -926646714, now seen corresponding path program 1 times [2025-04-26 16:58:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:49,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503594007] [2025-04-26 16:58:49,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:49,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:49,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:49,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:49,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:49,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:49,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:49,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:49,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:49,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:49,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2025-04-26 16:58:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:49,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133813469] [2025-04-26 16:58:49,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:58:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:49,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:49,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:49,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:58:49,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:49,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:49,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:49,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:49,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:49,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:49,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1449259160, now seen corresponding path program 1 times [2025-04-26 16:58:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:49,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228565723] [2025-04-26 16:58:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:49,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:49,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:49,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:49,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:49,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:49,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:49,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:49,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:49,167 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:49,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:49,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:49,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:49,167 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:49,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:49,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:49,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:49,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:49,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:49,167 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:49,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:49,182 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:49,182 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:49,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:49,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:49,184 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:49,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:58:49,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:49,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:49,205 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 16:58:49,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:49,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:49,207 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 16:58:49,208 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 16:58:49,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:49,211 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:49,275 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:49,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:58:49,280 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:49,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:49,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:49,280 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:49,280 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:49,280 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:49,280 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:49,280 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:49,280 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4_2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:49,280 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:49,280 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:49,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:49,297 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:49,297 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:49,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:49,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:49,299 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 16:58:49,301 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 16:58:49,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:49,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:49,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:49,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:49,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:49,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:49,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:49,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:49,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:49,322 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:49,322 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:49,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:49,329 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 16:58:49,330 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 16:58:49,330 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:49,333 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 16:58:49,334 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:49,334 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:49,334 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:58:49,339 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 16:58:49,340 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:49,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:49,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:49,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:49,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:49,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:49,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:49,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:49,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:49,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:49,383 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:49,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:49,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:49,393 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 196 transitions. cyclomatic complexity: 109 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 16:58:49,418 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 196 transitions. cyclomatic complexity: 109. 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 125 states and 233 transitions. Complement of second has 6 states. [2025-04-26 16:58:49,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:49,419 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 16:58:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 16:58:49,419 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:49,419 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,419 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:58:49,419 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,419 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:49,419 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:49,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 233 transitions. [2025-04-26 16:58:49,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:49,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 0 states and 0 transitions. [2025-04-26 16:58:49,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:49,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:49,420 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:49,420 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:49,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:49,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:49,420 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:49,420 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:58:49,420 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:49,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:49,420 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:49,432 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 16:58:49,433 INFO L201 PluginConnector]: Adding new model m4_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:49 BoogieIcfgContainer [2025-04-26 16:58:49,433 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:49,434 INFO L158 Benchmark]: Toolchain (without parser) took 3836.25ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.6MB in the beginning and 62.9MB in the end (delta: 20.7MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. [2025-04-26 16:58:49,434 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.79ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:49,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.98ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:49,434 INFO L158 Benchmark]: Boogie Preprocessor took 22.56ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.7MB in the end (delta: 969.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:49,435 INFO L158 Benchmark]: RCFGBuilder took 172.12ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 71.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:58:49,435 INFO L158 Benchmark]: BuchiAutomizer took 3600.14ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.4MB in the beginning and 62.9MB in the end (delta: 8.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:49,435 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.79ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.98ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.56ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.7MB in the end (delta: 969.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 172.12ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 71.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3600.14ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.4MB in the beginning and 62.9MB in the end (delta: 8.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1863 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s 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, 327 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 419 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 189 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 230 mSDtfsCounter, 244 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: 46ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 499, 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 16:58:49,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...