/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/2_thr/interleaved2-buggy.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:14,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:14,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:14,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:14,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:14,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:14,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:14,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:14,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:14,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:14,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:14,376 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:14,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:14,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:14,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:14,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:14,377 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:14,377 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:14,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:14,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:14,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:14,610 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:14,610 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:14,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/interleaved2-buggy.c.bpl [2025-04-26 18:42:14,613 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/interleaved2-buggy.c.bpl' [2025-04-26 18:42:14,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:14,628 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:14,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:14,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:14,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:14,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,659 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:14,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:14,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:14,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:14,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:14,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:14,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:14,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:14,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:14,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/1) ... [2025-04-26 18:42:14,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:14,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:14,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:14,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:14,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:14,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:14,723 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:14,755 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:14,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:14,819 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:14,819 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:14,834 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:14,834 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:14,836 INFO L201 PluginConnector]: Adding new model interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:14 BoogieIcfgContainer [2025-04-26 18:42:14,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:14,836 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:14,836 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:14,843 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:14,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:14,843 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:14" (1/2) ... [2025-04-26 18:42:14,844 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3575cd5f and model type interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:14, skipping insertion in model container [2025-04-26 18:42:14,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:14,844 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:14" (2/2) ... [2025-04-26 18:42:14,845 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved2-buggy.c.bpl [2025-04-26 18:42:14,888 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:14,931 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:14,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:14,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,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 18:42:14,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:14,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 56 flow [2025-04-26 18:42:15,018 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-26 18:42:15,020 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:15,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 2/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-26 18:42:15,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 56 flow [2025-04-26 18:42:15,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 17 transitions, 46 flow [2025-04-26 18:42:15,027 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 22 places, 17 transitions, 46 flow [2025-04-26 18:42:15,028 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 17 transitions, 46 flow [2025-04-26 18:42:15,039 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45 states, 44 states have (on average 1.9545454545454546) internal successors, (in total 86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,040 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 45 states, 44 states have (on average 1.9545454545454546) internal successors, (in total 86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,042 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:15,077 WARN L140 AmpleReduction]: Number of pruned transitions: 18 [2025-04-26 18:42:15,077 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:15,077 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 18:42:15,077 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:17 [2025-04-26 18:42:15,077 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:18 [2025-04-26 18:42:15,077 WARN L145 AmpleReduction]: Times succ was already a loop node:4 [2025-04-26 18:42:15,077 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6 [2025-04-26 18:42:15,077 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:15,078 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (in total 51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,084 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:15,084 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:15,084 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:15,084 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:15,084 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:15,084 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:15,084 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:15,084 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:15,086 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (in total 51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,093 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 18:42:15,093 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:15,093 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:15,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:15,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:15,096 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:15,096 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (in total 51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,097 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 18:42:15,098 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:15,098 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:15,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:15,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:15,101 INFO L752 eck$LassoCheckResult]: Stem: "[39] $Ultimate##0-->L12: Formula: (and (= v_f2_4 0) (= v_f1_3 0) (= v_x1_5 0) (= v_x2_5 0)) InVars {x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_3} OutVars{x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_3} AuxVars[] AssignedVars[]" "[57] L12-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:15,101 INFO L754 eck$LassoCheckResult]: Loop: "[45] L25-1-->L23: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[47] L23-->L24: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[48] L24-->L25: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[49] L25-->L25-1: Formula: (and (= v_f1_4 0) (< 0 v_f1_5)) InVars {f1=v_f1_5} OutVars{f1=v_f1_4} AuxVars[] AssignedVars[f1]" [2025-04-26 18:42:15,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2227, now seen corresponding path program 1 times [2025-04-26 18:42:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095390571] [2025-04-26 18:42:15,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:15,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:15,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:15,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:15,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:15,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:15,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2310820, now seen corresponding path program 1 times [2025-04-26 18:42:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854370844] [2025-04-26 18:42:15,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:15,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:15,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:15,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:15,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:15,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:15,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2058068566, now seen corresponding path program 1 times [2025-04-26 18:42:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674734398] [2025-04-26 18:42:15,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:15,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:15,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:15,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674734398] [2025-04-26 18:42:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674734398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:15,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:42:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825853868] [2025-04-26 18:42:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:15,392 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:15,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:15,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:15,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:15,393 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:15,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:15,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:15,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:15,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2-buggy.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:15,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:15,394 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:15,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:15,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:15,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:15,510 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:15,510 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:15,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:15,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:15,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:15,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:15,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:15,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:15,534 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:15,534 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:15,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:42:15,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:15,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:15,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:15,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:15,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:15,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:15,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:42:15,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:15,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:15,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:15,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:15,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:15,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:15,633 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:15,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:15,637 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:15,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:15,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:15,638 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:15,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:15,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:15,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:15,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:15,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2-buggy.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:15,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:15,638 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:15,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:15,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:15,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:15,697 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:15,700 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:15,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:15,702 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:15,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:15,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:15,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:15,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:15,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:15,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:15,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:15,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:15,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:15,721 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:15,725 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:15,725 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:15,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:15,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:15,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:15,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:15,730 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:15,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:15,734 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:15,734 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:15,735 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:15,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:15,746 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:15,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:15,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:15,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:15,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:15,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:15,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:15,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:15,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:15,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:15,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:15,856 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:15,858 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (in total 51), 38 states have internal predecessors, (51), 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 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,911 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (in total 51), 38 states have internal predecessors, (51), 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 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 83 states and 112 transitions. Complement of second has 6 states. [2025-04-26 18:42:15,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-04-26 18:42:15,917 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:15,917 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:15,918 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:42:15,918 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:15,918 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 18:42:15,918 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:15,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 112 transitions. [2025-04-26 18:42:15,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:42:15,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 36 states and 47 transitions. [2025-04-26 18:42:15,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-04-26 18:42:15,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 18:42:15,923 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2025-04-26 18:42:15,923 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:15,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-04-26 18:42:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2025-04-26 18:42:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-04-26 18:42:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (in total 43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-04-26 18:42:15,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-04-26 18:42:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:15,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:15,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:15,938 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:15,945 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-04-26 18:42:15,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2025-04-26 18:42:15,946 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:42:15,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 16 states and 18 transitions. [2025-04-26 18:42:15,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 18:42:15,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-04-26 18:42:15,946 INFO L74 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2025-04-26 18:42:15,947 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:15,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-04-26 18:42:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2025-04-26 18:42:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-04-26 18:42:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (in total 18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-04-26 18:42:15,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-04-26 18:42:15,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:15,949 INFO L438 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-04-26 18:42:15,949 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:15,949 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2025-04-26 18:42:15,949 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:42:15,949 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:15,949 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:15,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:15,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:15,950 INFO L752 eck$LassoCheckResult]: Stem: "[39] $Ultimate##0-->L12: Formula: (and (= v_f2_4 0) (= v_f1_3 0) (= v_x1_5 0) (= v_x2_5 0)) InVars {x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_3} OutVars{x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_3} AuxVars[] AssignedVars[]" "[57] L12-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[44] L25-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[46] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[60] L12-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:15,950 INFO L754 eck$LassoCheckResult]: Loop: "[51] L36-->L38: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[53] L38-->L38-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[54] L38-1-->L36: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:15,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 66388327, now seen corresponding path program 1 times [2025-04-26 18:42:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389552290] [2025-04-26 18:42:15,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:15,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:15,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:15,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:15,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:15,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:15,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,959 INFO L85 PathProgramCache]: Analyzing trace with hash 80499, now seen corresponding path program 1 times [2025-04-26 18:42:15,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040551080] [2025-04-26 18:42:15,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:15,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:15,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:15,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:15,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:15,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:15,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:15,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:15,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2089744205, now seen corresponding path program 1 times [2025-04-26 18:42:15,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:15,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611468973] [2025-04-26 18:42:15,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:15,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:15,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:15,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:15,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:15,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:15,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611468973] [2025-04-26 18:42:15,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611468973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:15,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:15,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:15,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135754717] [2025-04-26 18:42:15,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:16,005 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:16,005 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:16,005 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:16,005 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:16,005 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:16,005 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:16,005 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:16,005 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:16,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2-buggy.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:16,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:16,005 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:16,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:16,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:16,040 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:16,040 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:16,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:16,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:16,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:16,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:16,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:16,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:16,061 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 18:42:16,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:16,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:16,065 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:16,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:16,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:16,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:16,098 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:16,101 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 18:42:16,102 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:16,102 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:16,102 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:16,102 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:16,102 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:16,102 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:16,102 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:16,102 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:16,102 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2-buggy.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:16,102 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:16,102 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:16,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:16,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:16,135 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:16,135 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:16,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:16,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:16,137 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:16,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:16,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:16,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:16,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:16,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:16,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:16,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:16,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:16,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:16,153 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:16,154 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:16,154 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:16,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:16,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:16,156 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:16,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:16,158 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:16,161 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 18:42:16,161 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:16,161 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:16,161 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f2) = 1*f2 Supporting invariants [] [2025-04-26 18:42:16,166 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 18:42:16,167 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:16,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:16,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:16,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:16,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:16,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:16,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:16,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:16,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:16,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:16,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:16,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:16,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:16,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:16,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 18:42:16,209 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:16,210 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:16,218 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 29 states and 32 transitions. Complement of second has 4 states. [2025-04-26 18:42:16,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-04-26 18:42:16,219 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:16,219 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:16,219 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:16,219 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:16,219 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:16,220 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:16,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2025-04-26 18:42:16,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:16,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2025-04-26 18:42:16,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:16,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:16,221 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:16,221 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:16,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:16,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:16,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:16,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:16,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:16,222 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:16,222 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:42:16,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:42:16,222 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:16,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:42:16,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:16,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:16,222 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:16,222 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:16,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:16,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:16,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:42:16,222 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:16,222 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:16,223 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:16,223 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:16,223 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:16,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:42:16,234 INFO L201 PluginConnector]: Adding new model interleaved2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:16 BoogieIcfgContainer [2025-04-26 18:42:16,234 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:16,235 INFO L158 Benchmark]: Toolchain (without parser) took 1606.15ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.2MB in the beginning and 65.3MB in the end (delta: 20.9MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:16,235 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:16,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.18ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 83.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:16,235 INFO L158 Benchmark]: Boogie Preprocessor took 16.39ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.5MB in the end (delta: 974.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:16,235 INFO L158 Benchmark]: RCFGBuilder took 158.35ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 73.4MB in the end (delta: 9.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:16,236 INFO L158 Benchmark]: BuchiAutomizer took 1397.81ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.3MB in the beginning and 65.3MB in the end (delta: 8.0MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:16,237 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.78ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.18ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 83.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.39ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.5MB in the end (delta: 974.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 158.35ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 73.4MB in the end (delta: 9.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 1397.81ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.3MB in the beginning and 65.3MB in the end (delta: 8.0MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 22 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 34ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 152, Number of transitions in reduction automaton: 51, Number of states in reduction automaton: 39, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function f2 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:16,248 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...