/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/pp6.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:59:02,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:59:02,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:59:02,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:59:02,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:59:02,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:59:02,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:59:02,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:59:02,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:59:02,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:59:02,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:59:02,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:59:02,735 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:59:02,735 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:59:02,735 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:59:02,735 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:59:02,735 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:59:02,735 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:59:02,735 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:59:02,735 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:59:02,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:59:02,736 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:59:02,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:59:02,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:59:02,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:59:02,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:59:02,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:59:02,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:59:02,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:59:02,737 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:59:02,737 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:59:02,737 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:59:02,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:59:02,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:59:02,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:59:02,987 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:59:02,987 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:59:02,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/pp6.c.bpl [2025-04-26 16:59:02,989 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/pp6.c.bpl' [2025-04-26 16:59:03,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:59:03,010 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:59:03,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:59:03,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:59:03,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:59:03,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,048 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:59:03,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:59:03,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:59:03,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:59:03,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:59:03,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:59:03,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:59:03,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:59:03,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:59:03,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/1) ... [2025-04-26 16:59:03,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:59:03,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:03,108 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:59:03,115 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:59:03,134 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:59:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:59:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:59:03,135 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:59:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:59:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:59:03,135 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:59:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:59:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:59:03,135 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:59:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:59:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:59:03,135 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:59:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:59:03,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:59:03,135 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:59:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:59:03,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:59:03,136 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:59:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:59:03,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:59:03,137 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:59:03,173 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:59:03,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:59:03,261 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:59:03,261 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:59:03,269 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:59:03,269 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:59:03,269 INFO L201 PluginConnector]: Adding new model pp6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:59:03 BoogieIcfgContainer [2025-04-26 16:59:03,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:59:03,270 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:59:03,270 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:59:03,274 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:59:03,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:59:03,274 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:03" (1/2) ... [2025-04-26 16:59:03,275 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a23693 and model type pp6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:59:03, skipping insertion in model container [2025-04-26 16:59:03,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:59:03,275 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pp6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:59:03" (2/2) ... [2025-04-26 16:59:03,276 INFO L376 chiAutomizerObserver]: Analyzing ICFG pp6.c.bpl [2025-04-26 16:59:03,341 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:59:03,377 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:59:03,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:59:03,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:03,381 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:59:03,384 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:59:03,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 62 transitions, 166 flow [2025-04-26 16:59:03,467 INFO L116 PetriNetUnfolderBase]: 6/50 cut-off events. [2025-04-26 16:59:03,470 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:59:03,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 50 events. 6/50 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 129 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-04-26 16:59:03,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 62 transitions, 166 flow [2025-04-26 16:59:03,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 50 transitions, 136 flow [2025-04-26 16:59:03,477 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 63 places, 50 transitions, 136 flow [2025-04-26 16:59:03,482 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:59:09,956 WARN L140 AmpleReduction]: Number of pruned transitions: 230031 [2025-04-26 16:59:09,956 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:59:09,956 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 16276 [2025-04-26 16:59:09,956 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:44 [2025-04-26 16:59:09,956 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:48999 [2025-04-26 16:59:09,956 WARN L145 AmpleReduction]: Times succ was already a loop node:11332 [2025-04-26 16:59:09,957 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:44507 [2025-04-26 16:59:09,957 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:59:10,101 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 65320 states, 65319 states have (on average 2.421179136239073) internal successors, (in total 158149), 65319 states have internal predecessors, (158149), 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:59:10,108 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:59:10,109 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:59:10,109 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:59:10,109 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:59:10,109 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:59:10,109 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:59:10,109 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:59:10,109 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:59:10,207 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65320 states, 65319 states have (on average 2.421179136239073) internal successors, (in total 158149), 65319 states have internal predecessors, (158149), 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:59:11,143 INFO L131 ngComponentsAnalysis]: Automaton has 3318 accepting balls. 48846 [2025-04-26 16:59:11,143 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:11,144 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:11,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:59:11,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:11,149 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:59:11,232 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65320 states, 65319 states have (on average 2.421179136239073) internal successors, (in total 158149), 65319 states have internal predecessors, (158149), 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:59:12,044 INFO L131 ngComponentsAnalysis]: Automaton has 3318 accepting balls. 48846 [2025-04-26 16:59:12,044 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:12,044 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:12,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:59:12,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:12,049 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[162] L17-->L34: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" [2025-04-26 16:59:12,049 INFO L754 eck$LassoCheckResult]: Loop: "[119] L34-->L36: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[121] L36-->L37: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[123] L37-->L34: Formula: (= (+ v_c_2 1) v_c_1) InVars {c=v_c_2} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:12,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash 3913, now seen corresponding path program 1 times [2025-04-26 16:59:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:12,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981304962] [2025-04-26 16:59:12,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:12,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:12,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:12,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:12,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:12,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:12,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:12,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:12,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:12,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash 148024, now seen corresponding path program 1 times [2025-04-26 16:59:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:12,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108279516] [2025-04-26 16:59:12,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:12,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:12,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:12,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:12,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:12,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:12,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:12,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:12,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:12,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:12,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:12,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 116690416, now seen corresponding path program 1 times [2025-04-26 16:59:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:12,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580179789] [2025-04-26 16:59:12,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:59:12,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:59:12,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:12,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:12,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:12,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:59:12,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:59:12,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:12,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:12,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:12,300 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:12,301 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:12,301 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:12,301 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:12,301 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:12,301 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,301 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:12,301 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:12,302 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:59:12,302 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:12,302 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:12,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:12,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:12,368 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:12,368 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:12,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:12,371 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:59:12,373 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:59:12,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:12,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:12,413 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:59:12,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:12,420 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:59:12,421 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:59:12,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:12,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:12,472 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:59:12,473 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:59:12,483 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:59:12,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:12,489 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:59:12,491 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:59:12,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:12,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:12,527 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:59:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:12,537 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:59:12,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:12,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:12,539 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:59:12,606 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:12,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:12,612 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:12,612 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:12,612 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:12,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:12,612 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:12,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:12,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:12,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:59:12,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:12,612 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:12,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:12,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:12,661 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:12,669 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:12,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:12,677 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:59:12,684 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:59:12,684 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:59:12,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:12,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:12,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:12,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:12,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:12,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:12,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:12,725 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:59:12,730 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:59:12,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:12,733 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:59:12,735 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:59:12,739 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:59:12,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:12,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:12,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:12,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:12,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:12,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:12,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:12,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:12,769 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:12,769 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:12,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:12,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:12,776 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:59:12,777 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:59:12,781 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:12,785 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:59:12,785 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:12,786 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:12,786 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:59:12,797 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:59:12,801 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:12,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:12,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:12,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:12,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:12,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:12,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:12,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:12,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:12,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:12,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:12,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:12,897 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:12,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:12,976 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:59:13,007 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:59:13,105 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 65320 states, 65319 states have (on average 2.421179136239073) internal successors, (in total 158149), 65319 states have internal predecessors, (158149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) 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:59:14,118 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 65320 states, 65319 states have (on average 2.421179136239073) internal successors, (in total 158149), 65319 states have internal predecessors, (158149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) 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) Result 133750 states and 325630 transitions. Complement of second has 6 states. [2025-04-26 16:59:14,119 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:59:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) 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:59:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-04-26 16:59:14,128 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:59:14,128 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:14,129 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:59:14,129 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:14,129 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:59:14,129 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:14,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133750 states and 325630 transitions. [2025-04-26 16:59:15,489 INFO L131 ngComponentsAnalysis]: Automaton has 1953 accepting balls. 20853 [2025-04-26 16:59:16,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133750 states to 84703 states and 205440 transitions. [2025-04-26 16:59:16,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42292 [2025-04-26 16:59:16,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54410 [2025-04-26 16:59:16,439 INFO L74 IsDeterministic]: Start isDeterministic. Operand 84703 states and 205440 transitions. [2025-04-26 16:59:16,439 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:16,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84703 states and 205440 transitions. [2025-04-26 16:59:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84703 states and 205440 transitions. [2025-04-26 16:59:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84703 to 78644. [2025-04-26 16:59:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78644 states, 78644 states have (on average 2.5352347286506283) internal successors, (in total 199381), 78643 states have internal predecessors, (199381), 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:59:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78644 states to 78644 states and 199381 transitions. [2025-04-26 16:59:18,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78644 states and 199381 transitions. [2025-04-26 16:59:18,531 INFO L438 stractBuchiCegarLoop]: Abstraction has 78644 states and 199381 transitions. [2025-04-26 16:59:18,531 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:59:18,531 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78644 states and 199381 transitions. [2025-04-26 16:59:18,942 INFO L131 ngComponentsAnalysis]: Automaton has 1953 accepting balls. 20853 [2025-04-26 16:59:18,942 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:18,943 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:18,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:59:18,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:18,944 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[162] L17-->L34: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[118] L34-->L39: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[120] L39-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[122] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[165] L17-1-->L45: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" [2025-04-26 16:59:18,944 INFO L754 eck$LassoCheckResult]: Loop: "[125] L45-->L47: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[127] L47-->L48: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[129] L48-->L45: Formula: (= (+ v_c_4 1) v_c_3) InVars {c=v_c_4} OutVars{c=v_c_3} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:18,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash -677595018, now seen corresponding path program 1 times [2025-04-26 16:59:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:18,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326460260] [2025-04-26 16:59:18,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:18,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:18,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:18,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:18,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:18,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:18,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:18,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash 153982, now seen corresponding path program 1 times [2025-04-26 16:59:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:18,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084511141] [2025-04-26 16:59:18,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:18,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:18,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:18,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:18,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 113234153, now seen corresponding path program 1 times [2025-04-26 16:59:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:18,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654803234] [2025-04-26 16:59:18,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:18,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:59:18,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:59:18,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:18,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:59:18,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:59:18,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:18,989 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:18,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:18,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:18,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:18,990 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:18,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:18,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:18,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:59:18,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:18,990 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:18,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:19,015 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:19,016 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:19,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:19,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:19,018 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:59:19,019 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:59:19,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:19,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:19,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:19,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:19,038 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:59:19,039 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:59:19,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:19,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:19,071 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:59:19,071 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:59:19,076 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:59:19,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:19,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:19,078 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:59:19,080 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:59:19,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:19,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:19,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:19,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:19,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:19,099 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:59:19,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:19,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:19,102 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:59:19,161 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:19,165 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:59:19,165 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:19,165 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:19,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:19,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:19,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:19,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:19,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:19,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:19,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:59:19,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:19,166 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:19,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:19,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:19,195 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:19,195 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:19,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:19,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:19,197 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:59:19,198 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:59:19,199 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:59:19,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:19,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:19,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:19,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:19,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:19,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:19,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:19,214 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:59:19,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:19,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:19,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:19,221 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:59:19,223 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:59:19,226 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:59:19,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:19,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:19,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:19,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:19,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:19,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:19,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:19,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:19,242 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:19,242 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:19,245 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:59:19,245 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:59:19,247 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:19,250 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:59:19,250 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:19,250 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:19,250 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:59:19,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:19,256 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:19,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:19,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:19,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:19,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:19,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:19,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:19,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:19,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:19,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:19,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:19,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:19,295 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:19,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:19,323 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:59:19,323 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:59:19,323 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78644 states and 199381 transitions. cyclomatic complexity: 123812 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:20,703 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78644 states and 199381 transitions. cyclomatic complexity: 123812. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 174573 states and 437486 transitions. Complement of second has 6 states. [2025-04-26 16:59:20,706 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:59:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-04-26 16:59:20,707 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 126 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:59:20,707 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:20,707 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 126 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:59:20,707 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:20,707 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 126 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:59:20,707 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:20,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174573 states and 437486 transitions. [2025-04-26 16:59:22,238 INFO L131 ngComponentsAnalysis]: Automaton has 1015 accepting balls. 7635 [2025-04-26 16:59:23,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174573 states to 115160 states and 289406 transitions. [2025-04-26 16:59:23,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44136 [2025-04-26 16:59:23,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51163 [2025-04-26 16:59:23,242 INFO L74 IsDeterministic]: Start isDeterministic. Operand 115160 states and 289406 transitions. [2025-04-26 16:59:23,243 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:23,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115160 states and 289406 transitions. [2025-04-26 16:59:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115160 states and 289406 transitions. [2025-04-26 16:59:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115160 to 108538. [2025-04-26 16:59:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108538 states, 108538 states have (on average 2.539552967624242) internal successors, (in total 275638), 108537 states have internal predecessors, (275638), 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:59:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108538 states to 108538 states and 275638 transitions. [2025-04-26 16:59:25,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108538 states and 275638 transitions. [2025-04-26 16:59:25,600 INFO L438 stractBuchiCegarLoop]: Abstraction has 108538 states and 275638 transitions. [2025-04-26 16:59:25,600 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:59:25,600 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108538 states and 275638 transitions. [2025-04-26 16:59:26,309 INFO L131 ngComponentsAnalysis]: Automaton has 1015 accepting balls. 7635 [2025-04-26 16:59:26,309 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:26,309 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:26,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:26,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:26,310 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[162] L17-->L34: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[118] L34-->L39: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[120] L39-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[122] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[165] L17-1-->L45: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" "[124] L45-->L50: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[126] L50-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[128] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[168] L18-->L56: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" [2025-04-26 16:59:26,310 INFO L754 eck$LassoCheckResult]: Loop: "[131] L56-->L58: Formula: (< v_y1_1 v_z1_3) InVars {y1=v_y1_1, z1=v_z1_3} OutVars{y1=v_y1_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[133] L58-->L59: Formula: (= v_y1_2 (+ v_y1_3 1)) InVars {y1=v_y1_3} OutVars{y1=v_y1_2} AuxVars[] AssignedVars[y1]" "[135] L59-->L56: Formula: (= v_c_5 (+ v_c_6 1)) InVars {c=v_c_6} OutVars{c=v_c_5} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:26,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -784739168, now seen corresponding path program 1 times [2025-04-26 16:59:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:26,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044170570] [2025-04-26 16:59:26,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:26,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:59:26,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:59:26,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:26,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:26,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:59:26,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:59:26,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:26,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:26,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash 159940, now seen corresponding path program 1 times [2025-04-26 16:59:26,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:26,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92193108] [2025-04-26 16:59:26,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:26,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:26,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:26,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:26,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:26,323 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:26,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:26,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:26,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:26,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:26,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash -657431611, now seen corresponding path program 1 times [2025-04-26 16:59:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:26,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343037522] [2025-04-26 16:59:26,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:26,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:26,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:26,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:26,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:26,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:26,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:26,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:26,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:26,356 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:26,356 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:26,356 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:26,356 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:26,356 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:26,357 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:26,357 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:26,357 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:26,357 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:59:26,357 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:26,357 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:26,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:26,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:26,379 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:26,379 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:26,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:26,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:26,381 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:59:26,382 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:59:26,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:26,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:26,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:26,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:26,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:26,402 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:59:26,402 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:59:26,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:26,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:26,466 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:26,471 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:59:26,472 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:26,472 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:26,472 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:26,472 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:26,472 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:26,472 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:26,472 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:26,472 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:26,472 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:59:26,472 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:26,472 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:26,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:26,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:26,499 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:26,499 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:26,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:26,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:26,501 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:59:26,502 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:59:26,503 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:59:26,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:26,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:26,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:26,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:26,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:26,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:26,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:26,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:26,518 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:26,519 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:59:26,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:26,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:26,520 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:59:26,522 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:59:26,523 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:26,525 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:59:26,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:26,527 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:26,527 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:26,527 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, y1) = 1*z1 - 1*y1 Supporting invariants [] [2025-04-26 16:59:26,532 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:59:26,532 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:26,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:26,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:59:26,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:59:26,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:26,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:26,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:26,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:26,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:26,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:26,567 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:26,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:26,596 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:59:26,596 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:59:26,597 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 108538 states and 275638 transitions. cyclomatic complexity: 170371 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:59:28,369 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 108538 states and 275638 transitions. cyclomatic complexity: 170371. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 254349 states and 639058 transitions. Complement of second has 6 states. [2025-04-26 16:59:28,370 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:59:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:59:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-26 16:59:28,370 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:59:28,371 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:28,371 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:59:28,371 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:28,371 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:59:28,371 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:28,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254349 states and 639058 transitions. [2025-04-26 16:59:30,677 INFO L131 ngComponentsAnalysis]: Automaton has 483 accepting balls. 2583 [2025-04-26 16:59:31,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254349 states to 159193 states and 396243 transitions. [2025-04-26 16:59:31,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46160 [2025-04-26 16:59:31,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49665 [2025-04-26 16:59:31,915 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159193 states and 396243 transitions. [2025-04-26 16:59:31,915 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:31,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159193 states and 396243 transitions. [2025-04-26 16:59:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159193 states and 396243 transitions. [2025-04-26 16:59:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159193 to 154633. [2025-04-26 16:59:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154633 states, 154633 states have (on average 2.5136678458026425) internal successors, (in total 388696), 154632 states have internal predecessors, (388696), 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:59:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154633 states to 154633 states and 388696 transitions. [2025-04-26 16:59:35,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154633 states and 388696 transitions. [2025-04-26 16:59:35,166 INFO L438 stractBuchiCegarLoop]: Abstraction has 154633 states and 388696 transitions. [2025-04-26 16:59:35,166 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:59:35,166 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154633 states and 388696 transitions. [2025-04-26 16:59:36,061 INFO L131 ngComponentsAnalysis]: Automaton has 483 accepting balls. 2583 [2025-04-26 16:59:36,061 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:36,061 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:36,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:36,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:36,062 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[162] L17-->L34: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[118] L34-->L39: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[120] L39-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[122] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[165] L17-1-->L45: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" "[124] L45-->L50: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[126] L50-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[128] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[168] L18-->L56: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[130] L56-->L61: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[132] L61-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[134] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[171] L19-->L67: Formula: (and (= v_thread4Thread1of1ForFork5_thidvar2_2 4) (= v_thread4Thread1of1ForFork5_thidvar0_2 4) (= v_thread4Thread1of1ForFork5_thidvar1_2 4) (= v_thread4Thread1of1ForFork5_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork5_thidvar3=v_thread4Thread1of1ForFork5_thidvar3_2, thread4Thread1of1ForFork5_thidvar2=v_thread4Thread1of1ForFork5_thidvar2_2, thread4Thread1of1ForFork5_thidvar1=v_thread4Thread1of1ForFork5_thidvar1_2, thread4Thread1of1ForFork5_thidvar0=v_thread4Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_thidvar3, thread4Thread1of1ForFork5_thidvar2, thread4Thread1of1ForFork5_thidvar1, thread4Thread1of1ForFork5_thidvar0]" [2025-04-26 16:59:36,062 INFO L754 eck$LassoCheckResult]: Loop: "[137] L67-->L69: Formula: (< v_y2_1 v_z1_5) InVars {y2=v_y2_1, z1=v_z1_5} OutVars{y2=v_y2_1, z1=v_z1_5} AuxVars[] AssignedVars[]" "[139] L69-->L70: Formula: (= v_y2_2 (+ v_y2_3 1)) InVars {y2=v_y2_3} OutVars{y2=v_y2_2} AuxVars[] AssignedVars[y2]" "[141] L70-->L67: Formula: (= v_c_7 (+ v_c_8 1)) InVars {c=v_c_8} OutVars{c=v_c_7} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:36,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1094425927, now seen corresponding path program 1 times [2025-04-26 16:59:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:36,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240877668] [2025-04-26 16:59:36,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:36,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:59:36,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:59:36,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:36,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:59:36,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:59:36,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:36,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:36,073 INFO L85 PathProgramCache]: Analyzing trace with hash 165898, now seen corresponding path program 1 times [2025-04-26 16:59:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:36,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263692717] [2025-04-26 16:59:36,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:36,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:36,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:36,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:36,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:36,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:36,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 946183428, now seen corresponding path program 1 times [2025-04-26 16:59:36,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:36,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486920484] [2025-04-26 16:59:36,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:36,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:36,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:59:36,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:59:36,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:36,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:59:36,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:59:36,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:36,127 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:36,128 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:36,128 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:36,128 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:36,128 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:36,128 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,128 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:36,128 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:36,128 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:59:36,128 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:36,128 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:36,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:36,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:36,155 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:36,155 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:36,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:36,157 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:59:36,158 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:59:36,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:36,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:36,173 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:59:36,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:36,175 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:36,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:59:36,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:36,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:36,234 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:36,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:59:36,238 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:36,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:36,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:36,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:36,238 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:36,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:36,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:36,238 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:59:36,238 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:36,238 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:36,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:36,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:36,268 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:36,268 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:36,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:36,271 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:36,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:59:36,273 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:59:36,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:36,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:36,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:36,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:36,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:36,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:36,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:36,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:36,289 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:36,289 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:36,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:36,291 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:36,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:59:36,294 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:36,296 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:59:36,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:36,296 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:36,296 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:36,296 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, y2) = 1*z1 - 1*y2 Supporting invariants [] [2025-04-26 16:59:36,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:36,301 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:36,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:36,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:59:36,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:59:36,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:36,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:36,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:36,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:36,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:36,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:36,350 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:36,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:36,375 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:59:36,376 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:59:36,376 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154633 states and 388696 transitions. cyclomatic complexity: 238057 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:59:39,086 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154633 states and 388696 transitions. cyclomatic complexity: 238057. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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 363671 states and 900952 transitions. Complement of second has 6 states. [2025-04-26 16:59:39,087 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:59:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:59:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-04-26 16:59:39,087 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:59:39,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:39,088 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 17 letters. Loop has 3 letters. [2025-04-26 16:59:39,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:39,088 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 14 letters. Loop has 6 letters. [2025-04-26 16:59:39,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:39,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363671 states and 900952 transitions. [2025-04-26 16:59:42,326 INFO L131 ngComponentsAnalysis]: Automaton has 203 accepting balls. 795 [2025-04-26 16:59:43,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363671 states to 210583 states and 516698 transitions. [2025-04-26 16:59:43,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48762 [2025-04-26 16:59:44,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50551 [2025-04-26 16:59:44,052 INFO L74 IsDeterministic]: Start isDeterministic. Operand 210583 states and 516698 transitions. [2025-04-26 16:59:44,052 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:44,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 210583 states and 516698 transitions. [2025-04-26 16:59:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210583 states and 516698 transitions. [2025-04-26 16:59:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210583 to 206737. [2025-04-26 16:59:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206737 states, 206737 states have (on average 2.474936755394535) internal successors, (in total 511661), 206736 states have internal predecessors, (511661), 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:59:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206737 states to 206737 states and 511661 transitions. [2025-04-26 16:59:48,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 206737 states and 511661 transitions. [2025-04-26 16:59:48,016 INFO L438 stractBuchiCegarLoop]: Abstraction has 206737 states and 511661 transitions. [2025-04-26 16:59:48,016 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:59:48,016 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206737 states and 511661 transitions. [2025-04-26 16:59:48,955 INFO L131 ngComponentsAnalysis]: Automaton has 203 accepting balls. 795 [2025-04-26 16:59:48,955 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:48,955 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:48,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:48,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:48,956 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[162] L17-->L34: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[118] L34-->L39: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[120] L39-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[122] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[165] L17-1-->L45: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" "[124] L45-->L50: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[126] L50-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[128] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[168] L18-->L56: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[130] L56-->L61: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[132] L61-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[134] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[171] L19-->L67: Formula: (and (= v_thread4Thread1of1ForFork5_thidvar2_2 4) (= v_thread4Thread1of1ForFork5_thidvar0_2 4) (= v_thread4Thread1of1ForFork5_thidvar1_2 4) (= v_thread4Thread1of1ForFork5_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork5_thidvar3=v_thread4Thread1of1ForFork5_thidvar3_2, thread4Thread1of1ForFork5_thidvar2=v_thread4Thread1of1ForFork5_thidvar2_2, thread4Thread1of1ForFork5_thidvar1=v_thread4Thread1of1ForFork5_thidvar1_2, thread4Thread1of1ForFork5_thidvar0=v_thread4Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_thidvar3, thread4Thread1of1ForFork5_thidvar2, thread4Thread1of1ForFork5_thidvar1, thread4Thread1of1ForFork5_thidvar0]" "[136] L67-->L72: Formula: (<= v_z1_6 v_y2_4) InVars {y2=v_y2_4, z1=v_z1_6} OutVars{y2=v_y2_4, z1=v_z1_6} AuxVars[] AssignedVars[]" "[138] L72-->thread4FINAL: Formula: (= (+ v_f_9 1) v_f_8) InVars {f=v_f_9} OutVars{f=v_f_8} AuxVars[] AssignedVars[f]" "[140] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L20-->L78: Formula: (and (= 5 v_thread5Thread1of1ForFork0_thidvar4_2) (= 5 v_thread5Thread1of1ForFork0_thidvar3_2) (= 5 v_thread5Thread1of1ForFork0_thidvar2_2) (= 5 v_thread5Thread1of1ForFork0_thidvar1_2) (= 5 v_thread5Thread1of1ForFork0_thidvar0_2)) InVars {} OutVars{thread5Thread1of1ForFork0_thidvar4=v_thread5Thread1of1ForFork0_thidvar4_2, thread5Thread1of1ForFork0_thidvar3=v_thread5Thread1of1ForFork0_thidvar3_2, thread5Thread1of1ForFork0_thidvar2=v_thread5Thread1of1ForFork0_thidvar2_2, thread5Thread1of1ForFork0_thidvar1=v_thread5Thread1of1ForFork0_thidvar1_2, thread5Thread1of1ForFork0_thidvar0=v_thread5Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_thidvar4, thread5Thread1of1ForFork0_thidvar3, thread5Thread1of1ForFork0_thidvar2, thread5Thread1of1ForFork0_thidvar1, thread5Thread1of1ForFork0_thidvar0]" [2025-04-26 16:59:48,956 INFO L754 eck$LassoCheckResult]: Loop: "[143] L78-->L80: Formula: (< v_x3_1 v_z1_7) InVars {x3=v_x3_1, z1=v_z1_7} OutVars{x3=v_x3_1, z1=v_z1_7} AuxVars[] AssignedVars[]" "[145] L80-->L81: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[147] L81-->L78: Formula: (= (+ v_c_10 1) v_c_9) InVars {c=v_c_10} OutVars{c=v_c_9} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:48,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash -733115431, now seen corresponding path program 1 times [2025-04-26 16:59:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:48,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811086785] [2025-04-26 16:59:48,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:48,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:48,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:48,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:48,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:48,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:48,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:48,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:48,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:48,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:48,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:48,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:48,970 INFO L85 PathProgramCache]: Analyzing trace with hash 171856, now seen corresponding path program 1 times [2025-04-26 16:59:48,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:48,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891750366] [2025-04-26 16:59:48,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:48,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:48,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:48,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:48,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:48,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:48,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:48,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:48,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:48,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:48,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:48,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -332962696, now seen corresponding path program 1 times [2025-04-26 16:59:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:48,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680671011] [2025-04-26 16:59:48,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:48,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:48,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:48,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:48,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:48,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:48,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:48,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:48,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:48,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:48,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:49,010 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:49,010 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:49,010 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:49,010 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:49,010 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:49,010 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:49,010 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:49,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:49,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:49,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:49,010 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:49,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:49,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:49,035 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:49,035 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:49,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:49,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:49,037 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:49,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:59:49,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:49,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:49,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:49,058 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:49,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:59:49,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:49,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:49,123 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:49,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:49,127 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:49,127 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:49,127 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:49,127 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:49,127 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:49,127 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:49,127 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:49,127 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:49,127 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:49,127 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:49,127 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:49,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:49,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:49,152 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:49,152 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:49,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:49,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:49,153 INFO L229 MonitoredProcess]: Starting monitored process 27 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:59:49,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:59:49,156 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:59:49,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:49,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:49,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:49,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:49,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:49,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:49,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:49,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:49,172 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:49,172 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:49,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:49,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:49,174 INFO L229 MonitoredProcess]: Starting monitored process 28 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:59:49,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:59:49,176 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:49,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:49,179 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:49,179 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:49,179 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-04-26 16:59:49,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:49,186 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:49,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:49,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:49,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:49,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:49,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:49,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:49,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:49,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:49,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:49,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:49,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:49,234 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:49,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:49,255 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:59:49,255 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:59:49,256 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 206737 states and 511661 transitions. cyclomatic complexity: 309898 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 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:59:52,191 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 206737 states and 511661 transitions. cyclomatic complexity: 309898. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 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 478954 states and 1164792 transitions. Complement of second has 6 states. [2025-04-26 16:59:52,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 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:59:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-04-26 16:59:52,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:59:52,393 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:52,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:59:52,393 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:52,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 16:59:52,394 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:52,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 478954 states and 1164792 transitions. [2025-04-26 16:59:56,560 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 189 [2025-04-26 16:59:58,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 478954 states to 229042 states and 552264 transitions. [2025-04-26 16:59:58,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44739 [2025-04-26 16:59:58,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45693 [2025-04-26 16:59:58,220 INFO L74 IsDeterministic]: Start isDeterministic. Operand 229042 states and 552264 transitions. [2025-04-26 16:59:58,220 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:58,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 229042 states and 552264 transitions. [2025-04-26 16:59:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229042 states and 552264 transitions. [2025-04-26 17:00:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229042 to 225605. [2025-04-26 17:00:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225605 states, 225605 states have (on average 2.430460317812105) internal successors, (in total 548324), 225604 states have internal predecessors, (548324), 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 17:00:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225605 states to 225605 states and 548324 transitions. [2025-04-26 17:00:02,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 225605 states and 548324 transitions. [2025-04-26 17:00:02,608 INFO L438 stractBuchiCegarLoop]: Abstraction has 225605 states and 548324 transitions. [2025-04-26 17:00:02,608 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 17:00:02,608 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225605 states and 548324 transitions. [2025-04-26 17:00:03,656 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 189 [2025-04-26 17:00:03,656 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 17:00:03,656 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 17:00:03,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 17:00:03,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 17:00:03,659 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[162] L17-->L34: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[118] L34-->L39: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[120] L39-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[122] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[165] L17-1-->L45: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" "[124] L45-->L50: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[126] L50-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[128] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[168] L18-->L56: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[130] L56-->L61: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[132] L61-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[134] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[171] L19-->L67: Formula: (and (= v_thread4Thread1of1ForFork5_thidvar2_2 4) (= v_thread4Thread1of1ForFork5_thidvar0_2 4) (= v_thread4Thread1of1ForFork5_thidvar1_2 4) (= v_thread4Thread1of1ForFork5_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork5_thidvar3=v_thread4Thread1of1ForFork5_thidvar3_2, thread4Thread1of1ForFork5_thidvar2=v_thread4Thread1of1ForFork5_thidvar2_2, thread4Thread1of1ForFork5_thidvar1=v_thread4Thread1of1ForFork5_thidvar1_2, thread4Thread1of1ForFork5_thidvar0=v_thread4Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_thidvar3, thread4Thread1of1ForFork5_thidvar2, thread4Thread1of1ForFork5_thidvar1, thread4Thread1of1ForFork5_thidvar0]" "[136] L67-->L72: Formula: (<= v_z1_6 v_y2_4) InVars {y2=v_y2_4, z1=v_z1_6} OutVars{y2=v_y2_4, z1=v_z1_6} AuxVars[] AssignedVars[]" "[138] L72-->thread4FINAL: Formula: (= (+ v_f_9 1) v_f_8) InVars {f=v_f_9} OutVars{f=v_f_8} AuxVars[] AssignedVars[f]" "[140] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L20-->L78: Formula: (and (= 5 v_thread5Thread1of1ForFork0_thidvar4_2) (= 5 v_thread5Thread1of1ForFork0_thidvar3_2) (= 5 v_thread5Thread1of1ForFork0_thidvar2_2) (= 5 v_thread5Thread1of1ForFork0_thidvar1_2) (= 5 v_thread5Thread1of1ForFork0_thidvar0_2)) InVars {} OutVars{thread5Thread1of1ForFork0_thidvar4=v_thread5Thread1of1ForFork0_thidvar4_2, thread5Thread1of1ForFork0_thidvar3=v_thread5Thread1of1ForFork0_thidvar3_2, thread5Thread1of1ForFork0_thidvar2=v_thread5Thread1of1ForFork0_thidvar2_2, thread5Thread1of1ForFork0_thidvar1=v_thread5Thread1of1ForFork0_thidvar1_2, thread5Thread1of1ForFork0_thidvar0=v_thread5Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_thidvar4, thread5Thread1of1ForFork0_thidvar3, thread5Thread1of1ForFork0_thidvar2, thread5Thread1of1ForFork0_thidvar1, thread5Thread1of1ForFork0_thidvar0]" "[142] L78-->L83: Formula: (<= v_z1_8 v_x3_4) InVars {x3=v_x3_4, z1=v_z1_8} OutVars{x3=v_x3_4, z1=v_z1_8} AuxVars[] AssignedVars[]" "[144] L83-->thread5FINAL: Formula: (= v_f_10 (+ v_f_11 1)) InVars {f=v_f_11} OutVars{f=v_f_10} AuxVars[] AssignedVars[f]" "[146] thread5FINAL-->thread5EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[159] L21-->L89: Formula: (and (= 6 v_thread6Thread1of1ForFork1_thidvar1_2) (= 6 v_thread6Thread1of1ForFork1_thidvar3_2) (= 6 v_thread6Thread1of1ForFork1_thidvar0_2) (= 6 v_thread6Thread1of1ForFork1_thidvar2_2) (= 6 v_thread6Thread1of1ForFork1_thidvar5_2) (= 6 v_thread6Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread6Thread1of1ForFork1_thidvar2=v_thread6Thread1of1ForFork1_thidvar2_2, thread6Thread1of1ForFork1_thidvar3=v_thread6Thread1of1ForFork1_thidvar3_2, thread6Thread1of1ForFork1_thidvar0=v_thread6Thread1of1ForFork1_thidvar0_2, thread6Thread1of1ForFork1_thidvar1=v_thread6Thread1of1ForFork1_thidvar1_2, thread6Thread1of1ForFork1_thidvar4=v_thread6Thread1of1ForFork1_thidvar4_2, thread6Thread1of1ForFork1_thidvar5=v_thread6Thread1of1ForFork1_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_thidvar2, thread6Thread1of1ForFork1_thidvar3, thread6Thread1of1ForFork1_thidvar0, thread6Thread1of1ForFork1_thidvar1, thread6Thread1of1ForFork1_thidvar4, thread6Thread1of1ForFork1_thidvar5]" [2025-04-26 17:00:03,660 INFO L754 eck$LassoCheckResult]: Loop: "[149] L89-->L91: Formula: (< v_y3_2 v_z1_10) InVars {y3=v_y3_2, z1=v_z1_10} OutVars{y3=v_y3_2, z1=v_z1_10} AuxVars[] AssignedVars[]" "[151] L91-->L92: Formula: (= (+ v_y3_4 1) v_y3_3) InVars {y3=v_y3_4} OutVars{y3=v_y3_3} AuxVars[] AssignedVars[y3]" "[153] L92-->L89: Formula: (= v_c_11 (+ v_c_12 1)) InVars {c=v_c_12} OutVars{c=v_c_11} AuxVars[] AssignedVars[c]" [2025-04-26 17:00:03,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 17:00:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1731939608, now seen corresponding path program 1 times [2025-04-26 17:00:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 17:00:03,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834140036] [2025-04-26 17:00:03,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 17:00:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 17:00:03,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 17:00:03,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 17:00:03,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:03,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:03,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 17:00:03,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 17:00:03,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 17:00:03,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:03,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:03,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 17:00:03,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 17:00:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 177814, now seen corresponding path program 1 times [2025-04-26 17:00:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 17:00:03,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440468794] [2025-04-26 17:00:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 17:00:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 17:00:03,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 17:00:03,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 17:00:03,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:03,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:03,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 17:00:03,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 17:00:03,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 17:00:03,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:03,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:03,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 17:00:03,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 17:00:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash -770587057, now seen corresponding path program 1 times [2025-04-26 17:00:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 17:00:03,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401349385] [2025-04-26 17:00:03,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 17:00:03,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 17:00:03,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 17:00:03,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 17:00:03,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:03,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 17:00:03,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 17:00:03,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 17:00:03,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:03,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:03,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 17:00:03,719 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 17:00:03,719 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 17:00:03,720 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 17:00:03,720 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 17:00:03,720 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 17:00:03,720 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,720 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 17:00:03,720 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 17:00:03,720 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 17:00:03,720 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 17:00:03,720 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 17:00:03,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 17:00:03,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 17:00:03,742 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 17:00:03,742 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 17:00:03,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:03,744 INFO L229 MonitoredProcess]: Starting monitored process 29 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 17:00:03,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 17:00:03,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 17:00:03,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 17:00:03,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 17:00:03,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:03,765 INFO L229 MonitoredProcess]: Starting monitored process 30 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 17:00:03,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 17:00:03,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 17:00:03,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 17:00:03,795 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 17:00:03,795 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 17:00:03,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 17:00:03,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:03,802 INFO L229 MonitoredProcess]: Starting monitored process 31 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 17:00:03,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 17:00:03,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 17:00:03,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 17:00:03,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 17:00:03,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:03,819 INFO L229 MonitoredProcess]: Starting monitored process 32 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 17:00:03,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 17:00:03,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 17:00:03,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 17:00:03,882 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 17:00:03,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 17:00:03,886 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 17:00:03,886 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 17:00:03,886 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 17:00:03,886 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 17:00:03,887 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 17:00:03,887 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,887 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 17:00:03,887 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 17:00:03,887 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 17:00:03,887 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 17:00:03,887 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 17:00:03,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 17:00:03,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 17:00:03,905 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 17:00:03,905 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 17:00:03,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:03,907 INFO L229 MonitoredProcess]: Starting monitored process 33 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 17:00:03,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 17:00:03,909 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 17:00:03,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 17:00:03,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 17:00:03,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 17:00:03,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 17:00:03,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 17:00:03,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 17:00:03,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 17:00:03,919 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 17:00:03,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 17:00:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:03,926 INFO L229 MonitoredProcess]: Starting monitored process 34 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 17:00:03,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 17:00:03,927 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 17:00:03,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 17:00:03,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 17:00:03,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 17:00:03,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 17:00:03,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 17:00:03,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 17:00:03,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 17:00:03,938 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 17:00:03,940 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 17:00:03,940 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 17:00:03,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:03,941 INFO L229 MonitoredProcess]: Starting monitored process 35 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 17:00:03,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 17:00:03,943 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 17:00:03,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 17:00:03,945 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 17:00:03,945 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 17:00:03,945 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, y3) = 1*z1 - 1*y3 Supporting invariants [] [2025-04-26 17:00:03,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 17:00:03,950 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 17:00:03,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 17:00:03,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 17:00:03,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 17:00:03,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:03,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 17:00:03,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 17:00:03,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 17:00:03,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 17:00:03,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 17:00:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 17:00:03,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 17:00:03,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 17:00:04,013 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 17:00:04,014 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 17:00:04,014 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 225605 states and 548324 transitions. cyclomatic complexity: 328141 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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 17:00:06,906 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 225605 states and 548324 transitions. cyclomatic complexity: 328141. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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 475871 states and 1122862 transitions. Complement of second has 6 states. [2025-04-26 17:00:06,907 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 17:00:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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 17:00:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-04-26 17:00:06,907 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 22 letters. Loop has 3 letters. [2025-04-26 17:00:06,908 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 17:00:06,908 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 25 letters. Loop has 3 letters. [2025-04-26 17:00:06,908 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 17:00:06,908 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 139 transitions. Stem has 22 letters. Loop has 6 letters. [2025-04-26 17:00:06,908 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 17:00:06,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 475871 states and 1122862 transitions. [2025-04-26 17:00:11,033 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 17:00:11,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 475871 states to 0 states and 0 transitions. [2025-04-26 17:00:11,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 17:00:11,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 17:00:11,034 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 17:00:11,034 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 17:00:11,034 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 17:00:11,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 17:00:11,034 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 17:00:11,034 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 17:00:11,034 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 17:00:11,034 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 17:00:11,034 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 17:00:11,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 17:00:11,045 INFO L201 PluginConnector]: Adding new model pp6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 05:00:11 BoogieIcfgContainer [2025-04-26 17:00:11,045 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 17:00:11,045 INFO L158 Benchmark]: Toolchain (without parser) took 68035.01ms. Allocated memory was 155.2MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 86.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. [2025-04-26 17:00:11,045 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 17:00:11,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.79ms. Allocated memory is still 155.2MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 17:00:11,046 INFO L158 Benchmark]: Boogie Preprocessor took 27.91ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 83.0MB in the end (delta: 983.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 17:00:11,046 INFO L158 Benchmark]: RCFGBuilder took 189.90ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 73.0MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 17:00:11,046 INFO L158 Benchmark]: BuchiAutomizer took 67774.75ms. Allocated memory was 155.2MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 73.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. [2025-04-26 17:00:11,047 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.79ms. Allocated memory is still 155.2MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.91ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 83.0MB in the end (delta: 983.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 189.90ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 73.0MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 67774.75ms. Allocated memory was 155.2MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 73.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 67.6s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.3s. Büchi inclusion checks took 13.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 16.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 24524 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 22.8s Buchi closure took 0.4s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 570 mSDsluCounter, 845 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 453 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 392 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 6.7s InitialAbstraction: Time to compute Ample Reduction [ms]: 6584, Number of transitions in reduction automaton: 158149, Number of states in reduction automaton: 65320, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z1 and consists of 4 locations. One deterministic module has affine ranking function z1 + -1 * y3 and 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 17:00:11,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...