/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/bb7.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:40,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:40,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:40,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:40,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:40,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:40,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:40,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:40,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:40,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:40,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:40,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:40,351 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:40,351 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:40,352 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:40,352 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:40,352 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:40,352 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:40,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:40,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:40,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:40,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:40,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:40,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:40,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:40,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:40,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:40,354 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:40,354 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:40,354 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:40,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:40,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:40,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:40,614 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:40,615 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:40,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/bb7.c.bpl [2025-04-26 18:42:40,615 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/bb7.c.bpl' [2025-04-26 18:42:40,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:40,631 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:40,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:40,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:40,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:40,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,660 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:40,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:40,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:40,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:40,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:40,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:40,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:40,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:40,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:40,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/1) ... [2025-04-26 18:42:40,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:40,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:40,742 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:40,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:40,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:40,743 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:40,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:40,743 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:40,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:40,743 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:40,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:40,743 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:42:40,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:42:40,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:42:40,744 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:40,780 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:40,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:40,884 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:40,884 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:40,896 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:40,896 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:40,897 INFO L201 PluginConnector]: Adding new model bb7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:40 BoogieIcfgContainer [2025-04-26 18:42:40,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:40,898 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:40,899 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:40,903 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:40,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:40,904 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:40" (1/2) ... [2025-04-26 18:42:40,905 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41c2c0b5 and model type bb7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:40, skipping insertion in model container [2025-04-26 18:42:40,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:40,905 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:40" (2/2) ... [2025-04-26 18:42:40,906 INFO L376 chiAutomizerObserver]: Analyzing ICFG bb7.c.bpl [2025-04-26 18:42:40,973 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:42:41,015 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:41,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:41,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 136 flow [2025-04-26 18:42:41,112 INFO L116 PetriNetUnfolderBase]: 8/46 cut-off events. [2025-04-26 18:42:41,115 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:42:41,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 8/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-04-26 18:42:41,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 136 flow [2025-04-26 18:42:41,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 46 transitions, 116 flow [2025-04-26 18:42:41,123 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 51 places, 46 transitions, 116 flow [2025-04-26 18:42:41,124 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 116 flow [2025-04-26 18:42:41,382 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5268 states, 5267 states have (on average 4.43630149990507) internal successors, (in total 23366), 5267 states have internal predecessors, (23366), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,400 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 5268 states, 5267 states have (on average 4.43630149990507) internal successors, (in total 23366), 5267 states have internal predecessors, (23366), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,404 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:42,144 WARN L140 AmpleReduction]: Number of pruned transitions: 9248 [2025-04-26 18:42:42,144 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:42,144 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1557 [2025-04-26 18:42:42,145 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:235 [2025-04-26 18:42:42,145 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:3046 [2025-04-26 18:42:42,145 WARN L145 AmpleReduction]: Times succ was already a loop node:3869 [2025-04-26 18:42:42,145 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:479 [2025-04-26 18:42:42,145 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:42,161 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,168 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:42,169 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:42,169 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:42,169 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:42,169 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:42,169 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:42,169 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:42,169 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:42,181 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,292 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-04-26 18:42:42,292 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:42,293 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:42,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:42,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:42,297 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:42,306 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,370 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-04-26 18:42:42,370 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:42,370 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:42,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:42,371 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:42,375 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:42,375 INFO L754 eck$LassoCheckResult]: Loop: "[121] L26-->L28: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[123] L28-->L26: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:42,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash 4591, now seen corresponding path program 1 times [2025-04-26 18:42:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026899196] [2025-04-26 18:42:42,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,458 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 1 times [2025-04-26 18:42:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069217907] [2025-04-26 18:42:42,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash 4415825, now seen corresponding path program 1 times [2025-04-26 18:42:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047094012] [2025-04-26 18:42:42,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:42,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:42,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:42,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:42,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,569 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:42,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:42,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:42,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:42,570 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:42,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:42,571 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:42,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:42,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:42,571 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:42,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,673 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:42,674 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:42,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:42,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:42,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:42,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:42,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:42,776 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:42,780 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 18:42:42,780 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:42,780 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:42,780 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:42,780 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:42,780 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:42,780 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,780 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:42,780 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:42,780 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:42,781 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:42,781 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:42,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,806 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:42,809 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:42,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:42,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:42,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:42,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:42,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:42,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:42,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:42,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:42,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:42,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:42,845 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:42,845 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:42,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:42,851 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:42,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:42,855 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:42,855 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:42,856 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:42,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:42,864 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:42,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:42,949 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:42,957 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:43,294 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 14249 states and 36711 transitions. Complement of second has 7 states. [2025-04-26 18:42:43,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-04-26 18:42:43,302 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:43,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,305 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:43,305 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,305 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:43,305 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14249 states and 36711 transitions. [2025-04-26 18:42:43,500 INFO L131 ngComponentsAnalysis]: Automaton has 1012 accepting balls. 3078 [2025-04-26 18:42:43,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14249 states to 10721 states and 27962 transitions. [2025-04-26 18:42:43,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4910 [2025-04-26 18:42:43,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5941 [2025-04-26 18:42:43,685 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10721 states and 27962 transitions. [2025-04-26 18:42:43,689 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:43,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10721 states and 27962 transitions. [2025-04-26 18:42:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states and 27962 transitions. [2025-04-26 18:42:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 9735. [2025-04-26 18:42:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9735 states, 9735 states have (on average 2.5960965588084233) internal successors, (in total 25273), 9734 states have internal predecessors, (25273), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 25273 transitions. [2025-04-26 18:42:44,022 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9735 states and 25273 transitions. [2025-04-26 18:42:44,022 INFO L438 stractBuchiCegarLoop]: Abstraction has 9735 states and 25273 transitions. [2025-04-26 18:42:44,023 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:44,023 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9735 states and 25273 transitions. [2025-04-26 18:42:44,083 INFO L131 ngComponentsAnalysis]: Automaton has 1012 accepting balls. 3078 [2025-04-26 18:42:44,083 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:44,083 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:44,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:44,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:44,085 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:44,085 INFO L754 eck$LassoCheckResult]: Loop: "[130] L41-->L43: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[132] L43-->L41: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:44,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash 142482, now seen corresponding path program 1 times [2025-04-26 18:42:44,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:44,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712244097] [2025-04-26 18:42:44,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:44,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:44,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:44,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:44,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:44,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:44,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:44,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:44,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:44,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:44,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:44,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:44,095 INFO L85 PathProgramCache]: Analyzing trace with hash 5123, now seen corresponding path program 1 times [2025-04-26 18:42:44,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:44,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885151351] [2025-04-26 18:42:44,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:44,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:44,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:44,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:44,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:44,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:44,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:44,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:44,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:44,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:44,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:44,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:44,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash 136929364, now seen corresponding path program 1 times [2025-04-26 18:42:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:44,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824375989] [2025-04-26 18:42:44,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:44,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:44,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:44,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:44,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:44,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:44,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:44,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:44,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:44,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:44,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:44,131 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:44,132 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:44,132 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:44,132 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:44,132 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:44,132 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:44,132 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:44,132 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:44,133 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:44,133 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:44,133 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:44,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:44,152 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:44,152 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:44,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:44,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:44,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:44,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:44,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:44,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:44,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:44,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:44,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:44,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:44,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:44,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:44,243 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:44,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:44,248 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:44,248 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:44,248 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:44,248 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:44,248 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:44,248 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:44,248 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:44,248 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:44,248 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:44,248 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:44,248 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:44,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:44,269 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:44,270 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:44,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:44,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:44,272 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:44,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:44,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:44,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:44,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:44,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:44,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:44,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:44,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:44,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:44,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:44,289 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:44,289 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:44,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:44,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:44,293 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:44,296 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:44,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:44,297 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:44,297 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:44,297 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:42:44,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:44,304 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:44,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:44,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:44,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:44,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:44,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:44,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:44,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:44,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:44,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:44,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:44,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:44,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:44,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:44,340 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:44,341 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9735 states and 25273 transitions. cyclomatic complexity: 17275 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:44,741 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9735 states and 25273 transitions. cyclomatic complexity: 17275. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 30168 states and 81195 transitions. Complement of second has 7 states. [2025-04-26 18:42:44,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-04-26 18:42:44,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:44,743 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:44,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:44,743 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:44,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:42:44,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:44,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30168 states and 81195 transitions. [2025-04-26 18:42:45,168 INFO L131 ngComponentsAnalysis]: Automaton has 647 accepting balls. 1572 [2025-04-26 18:42:45,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30168 states to 19288 states and 51639 transitions. [2025-04-26 18:42:45,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5056 [2025-04-26 18:42:45,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6509 [2025-04-26 18:42:45,387 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19288 states and 51639 transitions. [2025-04-26 18:42:45,387 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:45,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19288 states and 51639 transitions. [2025-04-26 18:42:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19288 states and 51639 transitions. [2025-04-26 18:42:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19288 to 17904. [2025-04-26 18:42:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17904 states, 17904 states have (on average 2.7346403038427165) internal successors, (in total 48961), 17903 states have internal predecessors, (48961), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17904 states to 17904 states and 48961 transitions. [2025-04-26 18:42:45,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17904 states and 48961 transitions. [2025-04-26 18:42:45,940 INFO L438 stractBuchiCegarLoop]: Abstraction has 17904 states and 48961 transitions. [2025-04-26 18:42:45,940 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:45,940 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17904 states and 48961 transitions. [2025-04-26 18:42:46,126 INFO L131 ngComponentsAnalysis]: Automaton has 647 accepting balls. 1572 [2025-04-26 18:42:46,126 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:46,126 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:46,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:46,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:46,128 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[164] L14-->L56: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:42:46,129 INFO L754 eck$LassoCheckResult]: Loop: "[139] L56-->L58: Formula: (< v_x4_5 v_z_9) InVars {x4=v_x4_5, z=v_z_9} OutVars{x4=v_x4_5, z=v_z_9} AuxVars[] AssignedVars[]" "[141] L58-->L56: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:46,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 4417106, now seen corresponding path program 1 times [2025-04-26 18:42:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603392058] [2025-04-26 18:42:46,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:46,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:46,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:46,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:46,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 5411, now seen corresponding path program 1 times [2025-04-26 18:42:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147395533] [2025-04-26 18:42:46,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:46,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:46,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:46,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:46,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash -50123980, now seen corresponding path program 1 times [2025-04-26 18:42:46,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281300057] [2025-04-26 18:42:46,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:46,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:46,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:46,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,173 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:46,173 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:46,173 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:46,173 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:46,173 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:46,173 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,173 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:46,173 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:46,173 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:46,173 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:46,173 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:46,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:46,191 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:46,191 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:46,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,195 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:46,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:46,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:46,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:46,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,230 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:46,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:46,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:46,302 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:46,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:46,307 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:46,307 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:46,307 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:46,307 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:46,307 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:46,307 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,307 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:46,307 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:46,307 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:46,307 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:46,307 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:46,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:46,324 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:46,324 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,326 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:46,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:46,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:46,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:46,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:46,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:46,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:46,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:46,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:46,342 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:46,345 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:46,345 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:46,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,347 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:46,349 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:46,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:46,356 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:46,356 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:46,356 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z) = -1*x4 + 1*z Supporting invariants [] [2025-04-26 18:42:46,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:46,362 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:46,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:46,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:46,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:46,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:46,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:46,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:46,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:46,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:46,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:46,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:46,402 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:46,402 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17904 states and 48961 transitions. cyclomatic complexity: 33323 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:47,052 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17904 states and 48961 transitions. cyclomatic complexity: 33323. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 57514 states and 158530 transitions. Complement of second has 7 states. [2025-04-26 18:42:47,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-04-26 18:42:47,055 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:47,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,055 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:47,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,055 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:47,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57514 states and 158530 transitions. [2025-04-26 18:42:47,586 INFO L131 ngComponentsAnalysis]: Automaton has 291 accepting balls. 610 [2025-04-26 18:42:47,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57514 states to 35185 states and 98154 transitions. [2025-04-26 18:42:47,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6307 [2025-04-26 18:42:47,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7251 [2025-04-26 18:42:47,978 INFO L74 IsDeterministic]: Start isDeterministic. Operand 35185 states and 98154 transitions. [2025-04-26 18:42:47,978 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:47,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35185 states and 98154 transitions. [2025-04-26 18:42:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35185 states and 98154 transitions. [2025-04-26 18:42:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35185 to 33666. [2025-04-26 18:42:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33666 states, 33666 states have (on average 2.8083526406463495) internal successors, (in total 94546), 33665 states have internal predecessors, (94546), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33666 states to 33666 states and 94546 transitions. [2025-04-26 18:42:48,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33666 states and 94546 transitions. [2025-04-26 18:42:48,899 INFO L438 stractBuchiCegarLoop]: Abstraction has 33666 states and 94546 transitions. [2025-04-26 18:42:48,899 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:48,899 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33666 states and 94546 transitions. [2025-04-26 18:42:49,161 INFO L131 ngComponentsAnalysis]: Automaton has 291 accepting balls. 610 [2025-04-26 18:42:49,161 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:49,161 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:49,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:49,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:49,166 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[164] L14-->L56: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[167] L15-->L71: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 18:42:49,166 INFO L754 eck$LassoCheckResult]: Loop: "[148] L71-->L73: Formula: (< v_x5_5 v_z_15) InVars {x5=v_x5_5, z=v_z_15} OutVars{x5=v_x5_5, z=v_z_15} AuxVars[] AssignedVars[]" "[150] L73-->L71: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-04-26 18:42:49,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,166 INFO L85 PathProgramCache]: Analyzing trace with hash 136930453, now seen corresponding path program 1 times [2025-04-26 18:42:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419115772] [2025-04-26 18:42:49,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:49,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:49,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:49,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:49,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:49,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash 5699, now seen corresponding path program 1 times [2025-04-26 18:42:49,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054181049] [2025-04-26 18:42:49,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:49,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:49,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:49,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:49,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:49,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1553816105, now seen corresponding path program 1 times [2025-04-26 18:42:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114384367] [2025-04-26 18:42:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:49,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:49,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:49,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:49,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:49,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:49,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:49,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:49,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:49,216 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:49,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:49,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:49,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:49,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:49,217 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:49,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:49,237 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:49,237 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:49,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:49,240 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:49,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:49,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:49,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:49,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:42:49,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:49,265 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:49,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:49,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:49,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:49,331 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:49,336 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 18:42:49,336 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:49,336 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:49,336 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:49,336 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:49,336 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:49,336 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,336 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:49,336 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:49,336 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:49,336 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:49,336 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:49,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:49,353 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:49,353 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:49,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:49,356 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:49,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:49,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:49,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:49,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:49,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:49,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:49,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:49,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:49,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:49,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:49,378 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:49,378 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:49,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:49,381 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:49,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:49,386 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:49,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:49,390 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:49,390 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:49,390 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-04-26 18:42:49,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:42:49,397 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:49,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:49,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:49,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:49,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:49,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:49,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:49,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:49,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:49,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:49,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:49,445 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:49,445 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33666 states and 94546 transitions. cyclomatic complexity: 64299 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:50,326 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33666 states and 94546 transitions. cyclomatic complexity: 64299. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 98545 states and 269459 transitions. Complement of second has 7 states. [2025-04-26 18:42:50,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2025-04-26 18:42:50,327 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:50,327 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,327 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:50,327 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,327 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:50,327 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98545 states and 269459 transitions. [2025-04-26 18:42:51,403 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:42:51,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98545 states to 2627 states and 7155 transitions. [2025-04-26 18:42:51,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2025-04-26 18:42:51,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2025-04-26 18:42:51,421 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2627 states and 7155 transitions. [2025-04-26 18:42:51,421 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:51,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 18:42:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states and 7155 transitions. [2025-04-26 18:42:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2627. [2025-04-26 18:42:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2627 states have (on average 2.7236391320898363) internal successors, (in total 7155), 2626 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 7155 transitions. [2025-04-26 18:42:51,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 18:42:51,458 INFO L438 stractBuchiCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 18:42:51,458 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:51,458 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2627 states and 7155 transitions. [2025-04-26 18:42:51,467 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:42:51,467 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:51,467 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:51,468 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:51,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:51,468 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[124] L31-->L32-1: Formula: (<= 4 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:51,468 INFO L754 eck$LassoCheckResult]: Loop: "[126] L32-1-->L34: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[128] L34-->L32-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:51,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash 136889707, now seen corresponding path program 1 times [2025-04-26 18:42:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:51,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282001880] [2025-04-26 18:42:51,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:51,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:51,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:51,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:51,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:51,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282001880] [2025-04-26 18:42:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282001880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:51,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:51,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:51,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881699926] [2025-04-26 18:42:51,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:51,516 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:51,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash 4995, now seen corresponding path program 1 times [2025-04-26 18:42:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:51,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42717729] [2025-04-26 18:42:51,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:51,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:51,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:51,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:51,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:51,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:51,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:51,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:51,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:51,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:51,535 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:51,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:51,536 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:51,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:51,536 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:51,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:51,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:51,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:51,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:51,536 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:51,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:51,558 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:51,558 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,560 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:51,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:42:51,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:51,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:51,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:51,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,581 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:51,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:42:51,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:51,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:51,650 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:51,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:42:51,654 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:51,654 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:51,654 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:51,654 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:51,654 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:51,655 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,655 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:51,655 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:51,655 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:51,655 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:51,655 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:51,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:51,681 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:51,681 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:51,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,683 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:51,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:42:51,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:51,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:51,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:51,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:51,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:51,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:51,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:51,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:51,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:51,702 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:51,702 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:51,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,705 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 18:42:51,708 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 18:42:51,708 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:51,711 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 18:42:51,711 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:51,711 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:51,711 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:51,719 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 18:42:51,719 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:51,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:51,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:51,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:51,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:51,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:51,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:51,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:51,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:51,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:51,743 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:51,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:51,754 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:51,754 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2627 states and 7155 transitions. cyclomatic complexity: 4821 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:51,834 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2627 states and 7155 transitions. cyclomatic complexity: 4821. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5233 states and 14038 transitions. Complement of second has 7 states. [2025-04-26 18:42:51,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-26 18:42:51,835 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:51,835 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,835 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:51,836 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,836 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:51,836 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5233 states and 14038 transitions. [2025-04-26 18:42:51,866 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 36 [2025-04-26 18:42:51,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5233 states to 3383 states and 9002 transitions. [2025-04-26 18:42:51,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-04-26 18:42:51,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 790 [2025-04-26 18:42:51,885 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3383 states and 9002 transitions. [2025-04-26 18:42:51,885 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:51,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3383 states and 9002 transitions. [2025-04-26 18:42:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states and 9002 transitions. [2025-04-26 18:42:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 2706. [2025-04-26 18:42:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2706 states have (on average 2.7187730968218773) internal successors, (in total 7357), 2705 states have internal predecessors, (7357), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 7357 transitions. [2025-04-26 18:42:51,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2706 states and 7357 transitions. [2025-04-26 18:42:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:51,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:42:51,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:42:51,929 INFO L87 Difference]: Start difference. First operand 2706 states and 7357 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:51,970 INFO L93 Difference]: Finished difference Result 1817 states and 4717 transitions. [2025-04-26 18:42:51,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1817 states and 4717 transitions. [2025-04-26 18:42:51,979 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-04-26 18:42:51,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1817 states to 1807 states and 4671 transitions. [2025-04-26 18:42:51,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2025-04-26 18:42:51,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2025-04-26 18:42:51,987 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1807 states and 4671 transitions. [2025-04-26 18:42:51,987 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:51,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 18:42:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states and 4671 transitions. [2025-04-26 18:42:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2025-04-26 18:42:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1807 states have (on average 2.5849474266740455) internal successors, (in total 4671), 1806 states have internal predecessors, (4671), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 4671 transitions. [2025-04-26 18:42:52,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 18:42:52,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:42:52,014 INFO L438 stractBuchiCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 18:42:52,015 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:52,015 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1807 states and 4671 transitions. [2025-04-26 18:42:52,022 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-04-26 18:42:52,023 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:52,023 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:52,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:52,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:52,024 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[129] L41-->L45: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[131] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[133] L46-->L47-1: Formula: (<= 4 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 18:42:52,024 INFO L754 eck$LassoCheckResult]: Loop: "[135] L47-1-->L49: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[137] L49-->L47-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:52,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash -957082353, now seen corresponding path program 1 times [2025-04-26 18:42:52,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:52,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500529287] [2025-04-26 18:42:52,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:52,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:52,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:52,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:52,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:52,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500529287] [2025-04-26 18:42:52,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500529287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:52,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:52,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:52,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143999950] [2025-04-26 18:42:52,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:52,066 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:52,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash 5283, now seen corresponding path program 1 times [2025-04-26 18:42:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:52,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800856594] [2025-04-26 18:42:52,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:52,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:52,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:52,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:52,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:52,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:52,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:52,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:52,081 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:52,081 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:52,081 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:52,081 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:52,081 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:52,081 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:52,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:52,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:52,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:52,082 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:52,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:52,097 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:52,097 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:52,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:52,099 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 18:42:52,101 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 18:42:52,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:52,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:52,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:42:52,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:52,127 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 18:42:52,129 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 18:42:52,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:52,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:52,198 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:52,204 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 18:42:52,204 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:52,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:52,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:52,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:52,204 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:52,204 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,204 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:52,204 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:52,204 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:52,204 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:52,204 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:52,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:52,225 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:52,225 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:52,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:52,228 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 18:42:52,230 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 18:42:52,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:52,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:52,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:52,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:52,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:52,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:52,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:52,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:52,246 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:52,250 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:52,250 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:52,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:52,252 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 18:42:52,253 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 18:42:52,254 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:52,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:42:52,257 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:52,257 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:52,257 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z) = -1*x4 + 1*z Supporting invariants [] [2025-04-26 18:42:52,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:42:52,263 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:52,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:52,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:52,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:52,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:52,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:52,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:52,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:52,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:52,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:52,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:52,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:52,311 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:52,311 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1807 states and 4671 transitions. cyclomatic complexity: 3082 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:52,378 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1807 states and 4671 transitions. cyclomatic complexity: 3082. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3252 states and 8162 transitions. Complement of second has 7 states. [2025-04-26 18:42:52,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-04-26 18:42:52,379 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:42:52,379 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:52,379 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:42:52,379 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:52,379 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:42:52,379 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:52,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3252 states and 8162 transitions. [2025-04-26 18:42:52,397 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:42:52,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3252 states to 2196 states and 5453 transitions. [2025-04-26 18:42:52,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2025-04-26 18:42:52,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 543 [2025-04-26 18:42:52,407 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2196 states and 5453 transitions. [2025-04-26 18:42:52,407 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:52,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2196 states and 5453 transitions. [2025-04-26 18:42:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states and 5453 transitions. [2025-04-26 18:42:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1865. [2025-04-26 18:42:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1865 states have (on average 2.562466487935657) internal successors, (in total 4779), 1864 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 4779 transitions. [2025-04-26 18:42:52,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1865 states and 4779 transitions. [2025-04-26 18:42:52,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:52,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:42:52,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:42:52,503 INFO L87 Difference]: Start difference. First operand 1865 states and 4779 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:52,529 INFO L93 Difference]: Finished difference Result 793 states and 2071 transitions. [2025-04-26 18:42:52,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 2071 transitions. [2025-04-26 18:42:52,532 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:52,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 660 states and 1633 transitions. [2025-04-26 18:42:52,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2025-04-26 18:42:52,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2025-04-26 18:42:52,534 INFO L74 IsDeterministic]: Start isDeterministic. Operand 660 states and 1633 transitions. [2025-04-26 18:42:52,534 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:52,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 18:42:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 1633 transitions. [2025-04-26 18:42:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-04-26 18:42:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 660 states have (on average 2.474242424242424) internal successors, (in total 1633), 659 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1633 transitions. [2025-04-26 18:42:52,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 18:42:52,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:42:52,540 INFO L438 stractBuchiCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 18:42:52,540 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:52,540 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1633 transitions. [2025-04-26 18:42:52,541 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:52,541 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:52,541 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:52,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:52,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:52,542 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[129] L41-->L45: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[131] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[164] L14-->L56: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[138] L56-->L60: Formula: (<= v_z_10 v_x4_8) InVars {x4=v_x4_8, z=v_z_10} OutVars{x4=v_x4_8, z=v_z_10} AuxVars[] AssignedVars[]" "[140] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[142] L61-->L62-1: Formula: (<= 4 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" [2025-04-26 18:42:52,542 INFO L754 eck$LassoCheckResult]: Loop: "[144] L62-1-->L64: Formula: (< v_x5_1 v_z_11) InVars {x5=v_x5_1, z=v_z_11} OutVars{x5=v_x5_1, z=v_z_11} AuxVars[] AssignedVars[]" "[146] L64-->L62-1: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 18:42:52,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1189822374, now seen corresponding path program 1 times [2025-04-26 18:42:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:52,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027115881] [2025-04-26 18:42:52,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:52,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:52,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:52,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:52,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:52,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027115881] [2025-04-26 18:42:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027115881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:52,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:42:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614534023] [2025-04-26 18:42:52,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:52,591 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:52,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash 5571, now seen corresponding path program 1 times [2025-04-26 18:42:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:52,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339882105] [2025-04-26 18:42:52,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:52,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:52,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:52,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:52,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:52,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:52,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:52,615 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:52,615 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:52,615 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:52,615 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:52,615 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:52,615 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,615 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:52,615 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:52,615 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:42:52,615 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:52,615 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:52,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:52,630 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:52,630 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:52,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:52,632 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 18:42:52,633 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 18:42:52,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:52,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:52,650 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 18:42:52,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:52,654 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 18:42:52,655 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 18:42:52,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:52,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:52,721 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:52,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:42:52,726 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:52,726 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:52,726 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:52,726 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:52,726 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:52,726 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,726 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:52,726 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:52,726 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:42:52,727 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:52,727 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:52,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:52,744 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:52,744 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:52,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:52,747 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 18:42:52,748 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 18:42:52,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:52,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:52,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:52,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:52,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:52,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:52,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:52,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:52,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:52,771 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:52,771 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:52,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:52,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:52,773 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 18:42:52,774 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 18:42:52,775 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:52,778 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:52,778 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 18:42:52,778 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:52,778 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:52,778 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 18:42:52,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:52,785 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:52,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:52,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:52,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:52,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:52,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:52,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:52,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:52,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:52,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:52,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:52,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:52,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:52,826 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:52,826 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1633 transitions. cyclomatic complexity: 1052 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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 18:42:52,857 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1633 transitions. cyclomatic complexity: 1052. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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 901 states and 2105 transitions. Complement of second has 6 states. [2025-04-26 18:42:52,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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 18:42:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 18:42:52,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:52,858 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:52,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:42:52,858 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:52,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:42:52,858 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:52,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 901 states and 2105 transitions. [2025-04-26 18:42:52,862 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:52,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 901 states to 0 states and 0 transitions. [2025-04-26 18:42:52,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:52,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:52,862 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:52,862 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:52,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:52,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:52,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:52,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:42:52,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:42:52,863 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:52,863 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:42:52,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:42:52,863 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:52,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:42:52,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:52,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:52,863 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:52,863 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:52,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:52,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:52,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:42:52,864 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:52,864 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:42:52,864 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:52,864 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:52,864 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:52,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:52,876 INFO L201 PluginConnector]: Adding new model bb7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:52 BoogieIcfgContainer [2025-04-26 18:42:52,876 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:52,876 INFO L158 Benchmark]: Toolchain (without parser) took 12245.05ms. Allocated memory was 159.4MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 86.0MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 693.5MB. Max. memory is 8.0GB. [2025-04-26 18:42:52,876 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:52,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.08ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:52,877 INFO L158 Benchmark]: Boogie Preprocessor took 27.39ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:52,877 INFO L158 Benchmark]: RCFGBuilder took 207.26ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 72.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:52,877 INFO L158 Benchmark]: BuchiAutomizer took 11977.34ms. Allocated memory was 159.4MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 72.2MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 680.9MB. Max. memory is 8.0GB. [2025-04-26 18:42:52,878 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.13ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.08ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.39ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 207.26ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 72.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 11977.34ms. Allocated memory was 159.4MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 72.2MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 680.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.3s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 2.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4897 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 3.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 717 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 592 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 358 mSDtfsCounter, 592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 1.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 1134, Number of transitions in reduction automaton: 12152, Number of states in reduction automaton: 4839, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (3 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:52,891 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...