/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_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:55,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:55,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:55,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:55,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:55,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:55,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:55,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:55,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:55,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:55,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:55,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:55,604 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:55,604 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:55,604 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:55,604 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:55,604 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:55,604 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:55,604 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:55,604 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:55,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:55,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:55,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:55,605 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:55,606 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:55,606 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:55,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:55,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:55,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:55,841 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:55,842 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:55,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/complex_thr1_3.c.bpl [2025-04-26 16:56:55,844 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/complex_thr1_3.c.bpl' [2025-04-26 16:56:55,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:55,864 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:55,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:55,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:55,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:55,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,897 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:55,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:55,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:55,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:55,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:55,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,908 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:55,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:55,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:55,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:55,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:55,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:55,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:55,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:55,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:55,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:55,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:55,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:55,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:55,985 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:56,023 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:56,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:56,101 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:56,101 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:56,108 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:56,108 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:56,109 INFO L201 PluginConnector]: Adding new model complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:56 BoogieIcfgContainer [2025-04-26 16:56:56,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:56,110 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:56,110 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:56,114 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:56,114 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:56,114 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/2) ... [2025-04-26 16:56:56,115 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21df7062 and model type complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:56, skipping insertion in model container [2025-04-26 16:56:56,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:56,116 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:56" (2/2) ... [2025-04-26 16:56:56,116 INFO L376 chiAutomizerObserver]: Analyzing ICFG complex_thr1_3.c.bpl [2025-04-26 16:56:56,159 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:56,192 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:56,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:56,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:56,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:56,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 89 flow [2025-04-26 16:56:56,260 INFO L116 PetriNetUnfolderBase]: 5/28 cut-off events. [2025-04-26 16:56:56,262 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:56,265 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 16:56:56,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 89 flow [2025-04-26 16:56:56,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 28 transitions, 74 flow [2025-04-26 16:56:56,269 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 28 transitions, 74 flow [2025-04-26 16:56:56,274 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:56,410 WARN L140 AmpleReduction]: Number of pruned transitions: 264 [2025-04-26 16:56:56,410 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:56,410 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 56 [2025-04-26 16:56:56,410 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:24 [2025-04-26 16:56:56,410 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:135 [2025-04-26 16:56:56,410 WARN L145 AmpleReduction]: Times succ was already a loop node:60 [2025-04-26 16:56:56,410 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:64 [2025-04-26 16:56:56,411 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:56,413 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 216 states, 215 states have (on average 1.8511627906976744) internal successors, (in total 398), 215 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:56,418 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:56,418 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:56,418 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:56,418 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:56,418 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:56,418 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:56,419 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:56,419 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:56,420 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 216 states, 215 states have (on average 1.8511627906976744) internal successors, (in total 398), 215 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:56,433 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 168 [2025-04-26 16:56:56,434 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:56,434 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:56,437 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:56,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:56,438 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:56,438 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 216 states, 215 states have (on average 1.8511627906976744) internal successors, (in total 398), 215 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:56,443 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 168 [2025-04-26 16:56:56,443 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:56,444 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:56,444 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:56,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:56,447 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]" "[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 16:56:56,448 INFO L754 eck$LassoCheckResult]: Loop: "[88] L44-->L46: Formula: (< v_x_4 v_y_5) InVars {y=v_y_5, x=v_x_4} OutVars{y=v_y_5, x=v_x_4} AuxVars[] AssignedVars[]" "[90] L46-->L44: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-04-26 16:56:56,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 125402, now seen corresponding path program 1 times [2025-04-26 16:56:56,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:56,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520182422] [2025-04-26 16:56:56,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:56,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:56,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:56,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:56,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-04-26 16:56:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:56,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158619693] [2025-04-26 16:56:56,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:56,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 120514140, now seen corresponding path program 1 times [2025-04-26 16:56:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:56,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659771580] [2025-04-26 16:56:56,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:56,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:56,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:56,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:56,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,614 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:56,614 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:56,615 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:56,615 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:56,615 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:56,615 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,616 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:56,616 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:56,616 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:56,616 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:56,616 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:56,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:56,694 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:56,695 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:56,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:56,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:56,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:56,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:56,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:56,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:56,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:56,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:56,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:56,803 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:56,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:56,809 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:56,809 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:56,809 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:56,809 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:56,809 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:56,809 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,809 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:56,809 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:56,809 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:56,809 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:56,809 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:56,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:56,837 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:56,840 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:56,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:56,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:56,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:56,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:56,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:56,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:56,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:56,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:56,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:56,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:56,867 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:56,889 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:56,889 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:56,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:56,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:56,917 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:56,919 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:56,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:56:56,922 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:56,922 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:56,922 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, y) = -1*x + 1*y Supporting invariants [] [2025-04-26 16:56:56,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:56,931 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:56,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:56,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:56,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:56,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:56,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:56,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:56,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:57,069 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:57,071 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 216 states, 215 states have (on average 1.8511627906976744) internal successors, (in total 398), 215 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,179 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 216 states, 215 states have (on average 1.8511627906976744) internal successors, (in total 398), 215 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 477 states and 913 transitions. Complement of second has 6 states. [2025-04-26 16:56:57,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-26 16:56:57,187 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:56:57,188 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,188 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:57,188 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,188 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:57,188 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 477 states and 913 transitions. [2025-04-26 16:56:57,201 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 140 [2025-04-26 16:56:57,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 477 states to 312 states and 586 transitions. [2025-04-26 16:56:57,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2025-04-26 16:56:57,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2025-04-26 16:56:57,209 INFO L74 IsDeterministic]: Start isDeterministic. Operand 312 states and 586 transitions. [2025-04-26 16:56:57,209 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:57,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 312 states and 586 transitions. [2025-04-26 16:56:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 586 transitions. [2025-04-26 16:56:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2025-04-26 16:56:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 284 states have (on average 1.8485915492957747) internal successors, (in total 525), 283 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 525 transitions. [2025-04-26 16:56:57,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 284 states and 525 transitions. [2025-04-26 16:56:57,245 INFO L438 stractBuchiCegarLoop]: Abstraction has 284 states and 525 transitions. [2025-04-26 16:56:57,245 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:57,245 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 525 transitions. [2025-04-26 16:56:57,248 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 140 [2025-04-26 16:56:57,248 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:57,248 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:57,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:57,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:57,249 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 16:56:57,249 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 16:56:57,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash 3886763, now seen corresponding path program 1 times [2025-04-26 16:56:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825021373] [2025-04-26 16:56:57,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:57,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:57,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:57,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:57,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 108368, now seen corresponding path program 1 times [2025-04-26 16:56:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491037732] [2025-04-26 16:56:57,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:57,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:57,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:57,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:57,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash -173481882, now seen corresponding path program 1 times [2025-04-26 16:56:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099538726] [2025-04-26 16:56:57,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:57,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:57,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:57,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:57,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,290 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:57,290 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:57,290 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:57,290 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:57,290 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:57,290 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,290 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:57,290 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:57,290 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:57,290 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:57,290 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:57,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,327 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:57,328 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:57,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,333 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:57,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:57,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:57,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:57,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:57,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:57,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:57,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:57,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:57,378 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:57,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:57,382 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:57,382 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:57,382 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:57,383 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:57,383 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:57,383 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,383 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:57,383 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:57,383 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:57,383 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:57,383 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:57,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,412 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:57,412 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:57,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:57,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:57,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:57,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:57,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:57,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:57,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:57,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:57,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:57,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:57,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:57,433 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:57,433 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,435 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:57,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:57,438 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:57,440 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:57,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:56:57,441 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:57,442 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:57,442 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i) = 1*i Supporting invariants [] [2025-04-26 16:56:57,447 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 16:56:57,448 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:57,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:57,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:57,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:57,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:57,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:57,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,480 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:57,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:57,520 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:57,520 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 284 states and 525 transitions. cyclomatic complexity: 299 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 16:56:57,568 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 284 states and 525 transitions. cyclomatic complexity: 299. 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 788 states and 1510 transitions. Complement of second has 7 states. [2025-04-26 16:56:57,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:57,569 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 16:56:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 16:56:57,569 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:56:57,570 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,570 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:56:57,570 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,570 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:56:57,570 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 788 states and 1510 transitions. [2025-04-26 16:56:57,575 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 99 [2025-04-26 16:56:57,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 788 states to 585 states and 1112 transitions. [2025-04-26 16:56:57,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2025-04-26 16:56:57,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2025-04-26 16:56:57,580 INFO L74 IsDeterministic]: Start isDeterministic. Operand 585 states and 1112 transitions. [2025-04-26 16:56:57,581 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:57,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 585 states and 1112 transitions. [2025-04-26 16:56:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states and 1112 transitions. [2025-04-26 16:56:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 396. [2025-04-26 16:56:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 396 states have (on average 1.9696969696969697) internal successors, (in total 780), 395 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 780 transitions. [2025-04-26 16:56:57,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 396 states and 780 transitions. [2025-04-26 16:56:57,601 INFO L438 stractBuchiCegarLoop]: Abstraction has 396 states and 780 transitions. [2025-04-26 16:56:57,601 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:57,601 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 780 transitions. [2025-04-26 16:56:57,603 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 79 [2025-04-26 16:56:57,603 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:57,603 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:57,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:57,603 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:57,603 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]" "[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]" "[88] L44-->L46: Formula: (< v_x_4 v_y_5) InVars {y=v_y_5, x=v_x_4} OutVars{y=v_y_5, x=v_x_4} 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 16:56:57,603 INFO L754 eck$LassoCheckResult]: Loop: "[92] L53-->L55: Formula: (< v_x2_1 v_y_7) InVars {y=v_y_7, x2=v_x2_1} OutVars{y=v_y_7, 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 16:56:57,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 120514153, now seen corresponding path program 1 times [2025-04-26 16:56:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103221150] [2025-04-26 16:56:57,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:57,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:57,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:57,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:57,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 16:56:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603778104] [2025-04-26 16:56:57,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:57,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:57,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:57,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:57,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash -150013013, now seen corresponding path program 1 times [2025-04-26 16:56:57,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671606075] [2025-04-26 16:56:57,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:57,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:57,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:57,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:57,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,637 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:57,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:57,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:57,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:57,637 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:57,637 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,637 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:57,637 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:57,637 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:57,637 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:57,637 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:57,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,652 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:57,652 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:57,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,654 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:57,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:57,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:57,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:57,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:57,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,678 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:57,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:57,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:57,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:57,747 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:57,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:56:57,751 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:57,751 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:57,751 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:57,751 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:57,751 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:57,751 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,751 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:57,751 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:57,751 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:57,751 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:57,751 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:57,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,767 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:57,767 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:57,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,770 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:57,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:57,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:57,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:57,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:57,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:57,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:57,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:57,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:57,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:57,787 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:57,789 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:57,789 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:57,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,791 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:57,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:56:57,792 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:57,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:56:57,795 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:57,795 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:57,796 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, y) = -1*x2 + 1*y Supporting invariants [] [2025-04-26 16:56:57,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:57,803 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:57,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:57,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:57,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:57,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:57,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:57,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,832 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:57,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:57,845 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:57,845 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 780 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,898 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 780 transitions. cyclomatic complexity: 448. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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 865 states and 1732 transitions. Complement of second has 6 states. [2025-04-26 16:56:57,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-26 16:56:57,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:57,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:56:57,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:56:57,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 865 states and 1732 transitions. [2025-04-26 16:56:57,905 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 63 [2025-04-26 16:56:57,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 865 states to 582 states and 1169 transitions. [2025-04-26 16:56:57,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2025-04-26 16:56:57,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2025-04-26 16:56:57,908 INFO L74 IsDeterministic]: Start isDeterministic. Operand 582 states and 1169 transitions. [2025-04-26 16:56:57,908 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:57,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 582 states and 1169 transitions. [2025-04-26 16:56:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 1169 transitions. [2025-04-26 16:56:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 556. [2025-04-26 16:56:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 556 states have (on average 2.0107913669064748) internal successors, (in total 1118), 555 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1118 transitions. [2025-04-26 16:56:57,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 556 states and 1118 transitions. [2025-04-26 16:56:57,925 INFO L438 stractBuchiCegarLoop]: Abstraction has 556 states and 1118 transitions. [2025-04-26 16:56:57,925 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:57,925 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 556 states and 1118 transitions. [2025-04-26 16:56:57,927 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 63 [2025-04-26 16:56:57,927 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:57,927 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:57,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:57,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:57,927 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 16:56:57,927 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 16:56:57,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,928 INFO L85 PathProgramCache]: Analyzing trace with hash 120489731, now seen corresponding path program 1 times [2025-04-26 16:56:57,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034594116] [2025-04-26 16:56:57,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:57,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:57,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034594116] [2025-04-26 16:56:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034594116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:57,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933816147] [2025-04-26 16:56:57,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:57,968 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:57,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,968 INFO L85 PathProgramCache]: Analyzing trace with hash 111283, now seen corresponding path program 1 times [2025-04-26 16:56:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061884796] [2025-04-26 16:56:57,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:57,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:57,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:57,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:57,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,991 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:57,991 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:57,991 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:57,991 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:57,991 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:57,991 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,991 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:57,991 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:57,991 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:57,991 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:57,991 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:57,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:58,026 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:58,027 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:58,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,030 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:58,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:58,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:58,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:58,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,058 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:58,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:58,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:58,088 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:58,088 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 16:56:58,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:56:58,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,104 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:56:58,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:58,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:58,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:56:58,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,126 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:58,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:58,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:58,193 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:58,197 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 16:56:58,197 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:58,197 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:58,197 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:58,197 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:58,197 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:58,197 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,197 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:58,197 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:58,197 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:58,198 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:58,198 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:58,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:58,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:58,224 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:58,224 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:58,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,226 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:56:58,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:58,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:58,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:58,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:58,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:58,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:58,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:58,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:58,241 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:58,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:58,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,248 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:56:58,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:58,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:58,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:58,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:58,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:58,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:58,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:58,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:58,263 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:58,265 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:58,265 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:58,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,267 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:56:58,269 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:58,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:56:58,272 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:58,272 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:58,272 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, i) = 1*y - 1*i Supporting invariants [] [2025-04-26 16:56:58,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:56:58,278 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:58,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:58,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:58,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:58,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:58,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:58,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:58,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:58,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:58,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:58,302 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:58,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:58,343 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:58,343 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 556 states and 1118 transitions. cyclomatic complexity: 646 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:58,382 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 556 states and 1118 transitions. cyclomatic complexity: 646. 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 911 states and 1856 transitions. Complement of second has 6 states. [2025-04-26 16:56:58,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-26 16:56:58,384 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:58,384 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,384 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:58,384 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,384 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:56:58,384 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 911 states and 1856 transitions. [2025-04-26 16:56:58,390 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:58,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 911 states to 0 states and 0 transitions. [2025-04-26 16:56:58,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:58,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:58,391 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:58,391 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:58,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:58,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:58,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:58,394 INFO L87 Difference]: Start difference. First operand 0 states and 0 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 16:56:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:58,395 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:56:58,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:56:58,395 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:58,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:56:58,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:58,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:58,395 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:58,395 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:58,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:56:58,398 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,398 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:58,398 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:58,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:58,398 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:58,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:58,413 INFO L201 PluginConnector]: Adding new model complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:58 BoogieIcfgContainer [2025-04-26 16:56:58,413 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:58,414 INFO L158 Benchmark]: Toolchain (without parser) took 2549.70ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 95.0MB in the beginning and 100.0MB in the end (delta: -5.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:58,414 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 167.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:58,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.50ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 93.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:58,415 INFO L158 Benchmark]: Boogie Preprocessor took 23.16ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 92.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:58,415 INFO L158 Benchmark]: RCFGBuilder took 185.60ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 81.9MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:58,415 INFO L158 Benchmark]: BuchiAutomizer took 2303.62ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 81.7MB in the beginning and 100.0MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:58,419 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.71ms. Allocated memory is still 167.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.50ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 93.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.16ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 92.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 185.60ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 81.9MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2303.62ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 81.7MB in the beginning and 100.0MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 243 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 119 mSDtfsCounter, 152 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: 81ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 222, Number of transitions in reduction automaton: 398, Number of states in reduction automaton: 216, 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 -1 * x + y and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function y + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function y + -1 * i and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:58,430 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...