/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/3_thr/complex_thr1_3indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:28,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:28,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:28,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:28,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:28,689 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:28,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:28,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:28,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:28,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:28,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:28,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:28,714 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:28,714 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:28,714 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:28,714 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:28,714 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:28,714 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:28,714 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:28,714 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:28,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:28,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:28,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:28,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:28,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:28,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:28,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:28,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:28,716 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:28,716 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:28,716 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:28,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:28,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:28,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:28,957 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:28,958 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:28,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/complex_thr1_3indep.c.bpl [2025-04-26 18:42:28,961 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/complex_thr1_3indep.c.bpl' [2025-04-26 18:42:28,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:28,977 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:28,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:28,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:28,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:28,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,015 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:29,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:29,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:29,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:29,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:29,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:29,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:29,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:29,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:29,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/1) ... [2025-04-26 18:42:29,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,063 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:29,065 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:29,084 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:29,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:29,085 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:29,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:29,085 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:29,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:29,085 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:29,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:29,086 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:29,120 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:29,121 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:29,190 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:29,190 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:29,196 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:29,196 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:29,197 INFO L201 PluginConnector]: Adding new model complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:29 BoogieIcfgContainer [2025-04-26 18:42:29,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:29,197 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:29,197 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:29,201 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:29,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:29,202 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:28" (1/2) ... [2025-04-26 18:42:29,204 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68b49b4c and model type complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:29, skipping insertion in model container [2025-04-26 18:42:29,204 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:29,204 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:29" (2/2) ... [2025-04-26 18:42:29,205 INFO L376 chiAutomizerObserver]: Analyzing ICFG complex_thr1_3indep.c.bpl [2025-04-26 18:42:29,247 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:29,281 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:29,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:29,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,284 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:29,285 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:29,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 89 flow [2025-04-26 18:42:29,341 INFO L116 PetriNetUnfolderBase]: 5/28 cut-off events. [2025-04-26 18:42:29,343 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:29,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 5/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 18:42:29,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 89 flow [2025-04-26 18:42:29,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 28 transitions, 74 flow [2025-04-26 18:42:29,349 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 28 transitions, 74 flow [2025-04-26 18:42:29,350 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 28 transitions, 74 flow [2025-04-26 18:42:29,382 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 254 states, 253 states have (on average 3.0948616600790513) internal successors, (in total 783), 253 states have internal predecessors, (783), 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:29,383 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 254 states, 253 states have (on average 3.0948616600790513) internal successors, (in total 783), 253 states have internal predecessors, (783), 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:29,386 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:29,468 WARN L140 AmpleReduction]: Number of pruned transitions: 233 [2025-04-26 18:42:29,468 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:29,468 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 52 [2025-04-26 18:42:29,468 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:20 [2025-04-26 18:42:29,468 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:121 [2025-04-26 18:42:29,468 WARN L145 AmpleReduction]: Times succ was already a loop node:52 [2025-04-26 18:42:29,468 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:64 [2025-04-26 18:42:29,468 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:29,469 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 194 states, 193 states have (on average 1.8134715025906736) internal successors, (in total 350), 193 states have internal predecessors, (350), 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:29,476 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:29,476 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:29,476 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:29,476 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:29,476 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:29,476 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:29,477 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:29,477 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:29,478 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 194 states, 193 states have (on average 1.8134715025906736) internal successors, (in total 350), 193 states have internal predecessors, (350), 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:29,492 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 154 [2025-04-26 18:42:29,492 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:29,492 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:29,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:29,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:29,495 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:29,495 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 194 states, 193 states have (on average 1.8134715025906736) internal successors, (in total 350), 193 states have internal predecessors, (350), 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:29,499 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 154 [2025-04-26 18:42:29,499 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:29,500 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:29,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:29,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:29,503 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[76] L26-->L28-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:29,504 INFO L754 eck$LassoCheckResult]: Loop: "[79] L28-1-->L30: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[83] L30-->L31: Formula: (= (+ v_i_3 1) v_i_4) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[85] L31-->L28-1: Formula: (= (+ v_z_3 1) v_z_2) InVars {z=v_z_3} OutVars{z=v_z_2} AuxVars[] AssignedVars[z]" [2025-04-26 18:42:29,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash 3886763, now seen corresponding path program 1 times [2025-04-26 18:42:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:29,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529300134] [2025-04-26 18:42:29,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:29,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:29,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:29,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:29,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:29,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:29,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:29,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash 108368, now seen corresponding path program 1 times [2025-04-26 18:42:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:29,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509393269] [2025-04-26 18:42:29,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:29,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:29,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:29,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:29,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:29,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:29,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash -173481882, now seen corresponding path program 1 times [2025-04-26 18:42:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:29,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330592067] [2025-04-26 18:42:29,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:29,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:29,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:29,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:29,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:29,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:29,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:29,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:29,645 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:29,646 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:29,646 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:29,646 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:29,646 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:29,646 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,647 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:29,647 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:29,647 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:29,647 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:29,647 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:29,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,735 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:29,735 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:29,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,739 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:29,742 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:29,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:29,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:29,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:29,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,773 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:29,774 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:29,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:29,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:29,835 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:29,840 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:29,841 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:29,841 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:29,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:29,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:29,841 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:29,841 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,841 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:29,841 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:29,841 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:29,841 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:29,841 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:29,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,880 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:29,883 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,886 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:29,888 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:29,889 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:29,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:29,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:29,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:29,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:29,916 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:42:29,916 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:29,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,919 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:29,921 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:29,922 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:29,926 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 18:42:29,926 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:29,926 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:29,927 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i) = 1*i Supporting invariants [] [2025-04-26 18:42:29,932 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:29,934 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:29,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:29,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:29,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:29,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:29,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:29,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:29,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:29,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:29,983 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:29,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:30,029 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:30,043 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:30,044 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 194 states, 193 states have (on average 1.8134715025906736) internal successors, (in total 350), 193 states have internal predecessors, (350), 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.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:30,145 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 194 states, 193 states have (on average 1.8134715025906736) internal successors, (in total 350), 193 states have internal predecessors, (350), 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.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 539 states and 978 transitions. Complement of second has 7 states. [2025-04-26 18:42:30,146 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:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 18:42:30,155 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:42:30,158 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:30,158 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:42:30,158 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:30,158 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 18:42:30,158 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:30,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 978 transitions. [2025-04-26 18:42:30,171 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 149 [2025-04-26 18:42:30,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 368 states and 663 transitions. [2025-04-26 18:42:30,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2025-04-26 18:42:30,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2025-04-26 18:42:30,182 INFO L74 IsDeterministic]: Start isDeterministic. Operand 368 states and 663 transitions. [2025-04-26 18:42:30,183 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:30,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 368 states and 663 transitions. [2025-04-26 18:42:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 663 transitions. [2025-04-26 18:42:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 222. [2025-04-26 18:42:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.837837837837838) internal successors, (in total 408), 221 states have internal predecessors, (408), 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:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 408 transitions. [2025-04-26 18:42:30,218 INFO L240 hiAutomatonCegarLoop]: Abstraction has 222 states and 408 transitions. [2025-04-26 18:42:30,218 INFO L438 stractBuchiCegarLoop]: Abstraction has 222 states and 408 transitions. [2025-04-26 18:42:30,218 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:30,218 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 408 transitions. [2025-04-26 18:42:30,221 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 93 [2025-04-26 18:42:30,221 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:30,221 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:30,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:30,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:30,221 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[76] L26-->L28-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" "[78] L28-1-->L33-1: Formula: (<= v_i_5 0) InVars {i=v_i_5} OutVars{i=v_i_5} AuxVars[] AssignedVars[]" [2025-04-26 18:42:30,221 INFO L754 eck$LassoCheckResult]: Loop: "[82] L33-1-->L35: Formula: (< v_i_6 v_y_2) InVars {i=v_i_6, y=v_y_2} OutVars{i=v_i_6, y=v_y_2} AuxVars[] AssignedVars[]" "[84] L35-->L36: Formula: (= (+ v_i_8 1) v_i_7) InVars {i=v_i_8} OutVars{i=v_i_7} AuxVars[] AssignedVars[i]" "[86] L36-->L33-1: Formula: (= v_z_5 (+ v_z_4 1)) InVars {z=v_z_5} OutVars{z=v_z_4} AuxVars[] AssignedVars[z]" [2025-04-26 18:42:30,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash 120489731, now seen corresponding path program 1 times [2025-04-26 18:42:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145658902] [2025-04-26 18:42:30,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:30,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:30,276 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:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:30,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145658902] [2025-04-26 18:42:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145658902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:30,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070335359] [2025-04-26 18:42:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:30,281 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:30,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash 111283, now seen corresponding path program 1 times [2025-04-26 18:42:30,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664610762] [2025-04-26 18:42:30,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:30,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:30,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:30,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,313 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:30,313 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:30,313 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:30,313 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:30,313 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:30,313 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,313 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:30,313 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:30,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:30,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:30,314 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:30,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,345 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:30,345 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:30,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,349 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:30,350 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:30,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:30,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,367 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:30,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,371 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:30,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:30,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,379 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:30,399 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:30,400 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {z=0} Honda state: {z=0} Generalized eigenvectors: [{z=-1}, {z=7}, {z=-7}] Lambdas: [8, 1, 1] Nus: [1, 0] [2025-04-26 18:42:30,409 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:30,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,411 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:30,413 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:30,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:30,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:30,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,432 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:30,432 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:30,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:30,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,497 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:30,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:30,501 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:30,501 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:30,501 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:30,501 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:30,501 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:30,501 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,501 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:30,501 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:30,501 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:30,501 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:30,501 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:30,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,531 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:30,531 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:30,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,534 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:30,535 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:30,536 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:30,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:30,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:30,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:30,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:30,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:30,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:30,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:30,548 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:30,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:30,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,573 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:30,575 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:30,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:30,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:30,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:30,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:30,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:30,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:30,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:30,587 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:30,589 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:30,589 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:30,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,591 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:30,593 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:30,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:30,596 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:30,596 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:30,596 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, i) = 1*y - 1*i Supporting invariants [] [2025-04-26 18:42:30,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:30,602 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:30,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:30,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:30,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:30,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:30,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:30,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:30,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:30,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:30,646 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:30,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:30,670 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:30,671 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:30,671 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 222 states and 408 transitions. cyclomatic complexity: 225 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:30,704 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 222 states and 408 transitions. cyclomatic complexity: 225. 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 448 states and 859 transitions. Complement of second has 6 states. [2025-04-26 18:42:30,705 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:30,705 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:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 18:42:30,705 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:30,706 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:30,706 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:30,706 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:30,706 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:30,706 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:30,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 448 states and 859 transitions. [2025-04-26 18:42:30,710 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 60 [2025-04-26 18:42:30,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 448 states to 315 states and 587 transitions. [2025-04-26 18:42:30,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2025-04-26 18:42:30,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2025-04-26 18:42:30,715 INFO L74 IsDeterministic]: Start isDeterministic. Operand 315 states and 587 transitions. [2025-04-26 18:42:30,716 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:30,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 315 states and 587 transitions. [2025-04-26 18:42:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 587 transitions. [2025-04-26 18:42:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 246. [2025-04-26 18:42:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.9593495934959348) internal successors, (in total 482), 245 states have internal predecessors, (482), 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:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 482 transitions. [2025-04-26 18:42:30,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 246 states and 482 transitions. [2025-04-26 18:42:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:30,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:42:30,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:42:30,732 INFO L87 Difference]: Start difference. First operand 246 states and 482 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:30,764 INFO L93 Difference]: Finished difference Result 279 states and 537 transitions. [2025-04-26 18:42:30,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 537 transitions. [2025-04-26 18:42:30,766 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 60 [2025-04-26 18:42:30,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 279 states and 537 transitions. [2025-04-26 18:42:30,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2025-04-26 18:42:30,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2025-04-26 18:42:30,768 INFO L74 IsDeterministic]: Start isDeterministic. Operand 279 states and 537 transitions. [2025-04-26 18:42:30,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:30,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 279 states and 537 transitions. [2025-04-26 18:42:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 537 transitions. [2025-04-26 18:42:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 246. [2025-04-26 18:42:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.9552845528455285) internal successors, (in total 481), 245 states have internal predecessors, (481), 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:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 481 transitions. [2025-04-26 18:42:30,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 246 states and 481 transitions. [2025-04-26 18:42:30,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:42:30,775 INFO L438 stractBuchiCegarLoop]: Abstraction has 246 states and 481 transitions. [2025-04-26 18:42:30,775 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:30,775 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 481 transitions. [2025-04-26 18:42:30,776 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2025-04-26 18:42:30,776 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:30,776 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:30,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:42:30,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:30,776 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[77] L26-->L26-2: Formula: (or (<= v_x_3 0) (<= v_y_4 0)) InVars {y=v_y_4, x=v_x_3} OutVars{y=v_y_4, x=v_x_3} AuxVars[] AssignedVars[]" "[80] L26-2-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[100] L13-->L44: 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:30,776 INFO L754 eck$LassoCheckResult]: Loop: "[88] L44-->L46: Formula: (< v_x1_1 v_y1_1) InVars {y1=v_y1_1, x1=v_x1_1} OutVars{y1=v_y1_1, x1=v_x1_1} AuxVars[] AssignedVars[]" "[90] L46-->L44: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:30,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash -559784512, now seen corresponding path program 1 times [2025-04-26 18:42:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188089188] [2025-04-26 18:42:30,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:30,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:30,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:30,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:30,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-04-26 18:42:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773796691] [2025-04-26 18:42:30,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:30,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:30,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:30,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:30,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1082001214, now seen corresponding path program 1 times [2025-04-26 18:42:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482256724] [2025-04-26 18:42:30,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:30,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:30,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:30,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:30,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,829 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:30,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:30,830 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:30,830 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:30,830 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:30,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,830 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:30,830 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:30,830 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:30,830 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:30,830 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:30,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,845 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:30,845 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:30,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:30,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:30,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:30,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,874 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:30,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:30,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,947 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:30,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:30,952 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:30,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:30,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:30,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:30,952 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:30,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,952 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:30,952 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:30,952 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:30,952 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:30,952 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:30,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,967 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:30,967 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:30,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,969 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:30,972 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:30,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:30,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:30,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:30,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:30,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:30,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:30,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:30,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:30,987 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:30,987 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,989 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:30,991 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:30,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:30,994 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:30,994 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:30,994 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, x1) = 1*y1 - 1*x1 Supporting invariants [] [2025-04-26 18:42:30,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,000 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:31,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:31,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:31,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,049 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:31,049 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:31,050 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 246 states and 481 transitions. cyclomatic complexity: 267 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,098 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 246 states and 481 transitions. cyclomatic complexity: 267. 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 609 states and 1210 transitions. Complement of second has 6 states. [2025-04-26 18:42:31,099 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:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 18:42:31,101 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:31,101 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,101 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:42:31,102 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,102 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:42:31,102 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 609 states and 1210 transitions. [2025-04-26 18:42:31,116 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:42:31,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 609 states to 321 states and 626 transitions. [2025-04-26 18:42:31,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2025-04-26 18:42:31,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-04-26 18:42:31,118 INFO L74 IsDeterministic]: Start isDeterministic. Operand 321 states and 626 transitions. [2025-04-26 18:42:31,119 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:31,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 321 states and 626 transitions. [2025-04-26 18:42:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 626 transitions. [2025-04-26 18:42:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 304. [2025-04-26 18:42:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 304 states have (on average 1.957236842105263) internal successors, (in total 595), 303 states have internal predecessors, (595), 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:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 595 transitions. [2025-04-26 18:42:31,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 304 states and 595 transitions. [2025-04-26 18:42:31,125 INFO L438 stractBuchiCegarLoop]: Abstraction has 304 states and 595 transitions. [2025-04-26 18:42:31,125 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:31,125 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 595 transitions. [2025-04-26 18:42:31,126 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:42:31,126 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:31,126 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:31,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:31,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:31,127 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[77] L26-->L26-2: Formula: (or (<= v_x_3 0) (<= v_y_4 0)) InVars {y=v_y_4, x=v_x_3} OutVars{y=v_y_4, x=v_x_3} AuxVars[] AssignedVars[]" "[80] L26-2-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[100] L13-->L44: 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]" "[87] L44-->thread2FINAL: Formula: (<= v_y1_2 v_x1_4) InVars {y1=v_y1_2, x1=v_x1_4} OutVars{y1=v_y1_2, x1=v_x1_4} AuxVars[] AssignedVars[]" "[89] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L14-->L53: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:42:31,127 INFO L754 eck$LassoCheckResult]: Loop: "[92] L53-->L55: Formula: (< v_x2_1 v_y2_1) InVars {y2=v_y2_1, x2=v_x2_1} OutVars{y2=v_y2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[94] L55-->L53: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:31,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,127 INFO L85 PathProgramCache]: Analyzing trace with hash 817699845, now seen corresponding path program 1 times [2025-04-26 18:42:31,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701815168] [2025-04-26 18:42:31,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:31,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:31,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 18:42:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849228937] [2025-04-26 18:42:31,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash -169461177, now seen corresponding path program 1 times [2025-04-26 18:42:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178335476] [2025-04-26 18:42:31,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:31,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:31,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:31,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:31,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,173 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,173 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,173 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,173 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,173 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:31,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:31,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,174 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,193 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,193 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:31,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,195 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:31,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:31,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,215 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:42:31,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:31,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,267 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:31,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,271 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,271 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,271 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,271 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:31,271 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,271 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3indep.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:31,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,271 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,287 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,287 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:31,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,289 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:42:31,293 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:31,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:31,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:31,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:31,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:31,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:31,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:31,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:31,305 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:31,308 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:31,308 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:31,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,310 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:42:31,312 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:31,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,315 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:31,315 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:31,315 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = 1*y2 - 1*x2 Supporting invariants [] [2025-04-26 18:42:31,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,324 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:31,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:31,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:31,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,350 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,363 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:31,363 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:31,363 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 304 states and 595 transitions. cyclomatic complexity: 327 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,388 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 304 states and 595 transitions. cyclomatic complexity: 327. 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 678 states and 1331 transitions. Complement of second has 6 states. [2025-04-26 18:42:31,392 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:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 18:42:31,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:31,393 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:31,393 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,394 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:42:31,394 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 678 states and 1331 transitions. [2025-04-26 18:42:31,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:31,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 678 states to 0 states and 0 transitions. [2025-04-26 18:42:31,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:31,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:31,397 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:31,397 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:31,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:31,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:31,397 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:31,398 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:31,398 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:31,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:31,398 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:31,407 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:31,408 INFO L201 PluginConnector]: Adding new model complex_thr1_3indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:31 BoogieIcfgContainer [2025-04-26 18:42:31,408 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:31,409 INFO L158 Benchmark]: Toolchain (without parser) took 2431.93ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.1MB in the beginning and 75.3MB in the end (delta: 10.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:31,409 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.77ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:31,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.69ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:31,410 INFO L158 Benchmark]: Boogie Preprocessor took 18.34ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.0MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:31,410 INFO L158 Benchmark]: RCFGBuilder took 160.62ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.0MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:31,410 INFO L158 Benchmark]: BuchiAutomizer took 2211.20ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.9MB in the beginning and 75.3MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:31,411 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.77ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.69ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.34ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.0MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 160.62ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.0MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2211.20ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.9MB in the beginning and 75.3MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 265 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 332 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 171 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp84 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 191, Number of transitions in reduction automaton: 350, Number of states in reduction automaton: 194, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function y + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + y1 and consists of 4 locations. One deterministic module has affine ranking function y2 + -1 * x2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:31,425 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...