/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 ../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:25,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:25,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:25,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:25,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:25,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:25,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:25,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:25,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:25,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:25,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:25,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:25,225 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:25,225 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:25,226 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:25,226 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:25,226 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:25,226 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:25,226 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:25,226 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:25,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:25,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:25,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:25,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:25,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:25,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:25,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:25,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:25,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:25,228 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:25,228 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:25,228 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:25,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:25,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:25,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:25,429 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:25,429 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:25,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl [2025-04-26 18:38:25,432 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl' [2025-04-26 18:38:25,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:25,446 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:25,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:25,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:25,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:25,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,480 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:25,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:25,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:25,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:25,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:25,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:25,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:25,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:25,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:25,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/1) ... [2025-04-26 18:38:25,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:25,527 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:38:25,532 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:38:25,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:25,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:25,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:25,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2025-04-26 18:38:25,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-26 18:38:25,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-26 18:38:25,551 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:38:25,582 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:25,583 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:25,630 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:25,630 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:25,636 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:25,637 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:25,637 INFO L201 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:25 BoogieIcfgContainer [2025-04-26 18:38:25,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:25,638 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:25,638 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:25,642 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:25,643 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:25,643 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:25" (1/2) ... [2025-04-26 18:38:25,644 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49f833b6 and model type bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:25, skipping insertion in model container [2025-04-26 18:38:25,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:25,644 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:25" (2/2) ... [2025-04-26 18:38:25,645 INFO L376 chiAutomizerObserver]: Analyzing ICFG bigNumberOfThreads.bpl [2025-04-26 18:38:25,675 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:25,714 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:25,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:25,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:25,716 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:38:25,718 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:38:25,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 30 flow [2025-04-26 18:38:25,769 INFO L116 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-04-26 18:38:25,771 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 18:38:25,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 18 events. 1/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 8. Up to 2 conditions per place. [2025-04-26 18:38:25,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 13 transitions, 30 flow [2025-04-26 18:38:25,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 13 transitions, 30 flow [2025-04-26 18:38:25,776 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 15 places, 13 transitions, 30 flow [2025-04-26 18:38:25,776 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 13 transitions, 30 flow [2025-04-26 18:38:25,783 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 32 states, 28 states have (on average 1.7142857142857142) internal successors, (in total 48), 31 states have internal predecessors, (48), 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:38:25,784 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 32 states, 28 states have (on average 1.7142857142857142) internal successors, (in total 48), 31 states have internal predecessors, (48), 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:38:25,785 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:25,813 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 68#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:38:25,814 WARN L140 AmpleReduction]: Number of pruned transitions: 8 [2025-04-26 18:38:25,814 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:25,814 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:25,814 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:13 [2025-04-26 18:38:25,814 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8 [2025-04-26 18:38:25,814 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:25,814 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:25,814 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:25,815 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (in total 24), 21 states have internal predecessors, (24), 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:38:25,820 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:25,820 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:25,820 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:25,820 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:25,820 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:25,820 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:25,820 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:25,820 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:25,821 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (in total 24), 21 states have internal predecessors, (24), 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:38:25,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:25,828 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:25,828 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:25,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:25,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:25,831 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:25,831 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (in total 24), 21 states have internal predecessors, (24), 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:38:25,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:25,832 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:25,832 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:25,832 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:25,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:25,835 INFO L752 eck$LassoCheckResult]: Stem: "[20] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[17] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[22] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[30] L30-->$Ultimate##0: Formula: (= v_threadThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_i_7) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_7} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_7, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of1ForFork0_thidvar0]" "[15] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[22] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[28] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[26] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:25,835 INFO L754 eck$LassoCheckResult]: Loop: "[29] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:25,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1549690411, now seen corresponding path program 1 times [2025-04-26 18:38:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:25,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157387796] [2025-04-26 18:38:25,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:25,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:25,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:25,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:25,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:25,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:25,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:25,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:25,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:25,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:25,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:25,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 60, now seen corresponding path program 1 times [2025-04-26 18:38:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:25,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869319561] [2025-04-26 18:38:25,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:25,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:25,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:25,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:25,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:25,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:25,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:25,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:25,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:25,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 795762514, now seen corresponding path program 1 times [2025-04-26 18:38:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:25,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674534271] [2025-04-26 18:38:25,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:25,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:25,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:25,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:25,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:25,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:25,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:25,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:25,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:25,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:25,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:25,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:25,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:25,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:26,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:26,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:26,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,009 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:26,013 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:26,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:38:26,024 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:26,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:26,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:26,027 INFO L229 MonitoredProcess]: Starting monitored process 3 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:38:26,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 18:38:26,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:26,044 INFO L116 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-04-26 18:38:26,044 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:38:26,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 27 events. 1/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-04-26 18:38:26,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:26,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:26,045 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:26,045 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:26,052 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 101 states, 95 states have (on average 2.221052631578947) internal successors, (in total 211), 100 states have internal predecessors, (211), 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:38:26,052 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 101 states, 95 states have (on average 2.221052631578947) internal successors, (in total 211), 100 states have internal predecessors, (211), 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:38:26,052 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:26,072 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 181#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL, threadFINAL]true [2025-04-26 18:38:26,073 WARN L140 AmpleReduction]: Number of pruned transitions: 40 [2025-04-26 18:38:26,073 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:26,073 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:26,073 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:24 [2025-04-26 18:38:26,073 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:27 [2025-04-26 18:38:26,073 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:26,073 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:26,073 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:26,073 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 52 states, 46 states have (on average 1.3478260869565217) internal successors, (in total 62), 51 states have internal predecessors, (62), 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:38:26,074 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:26,074 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:26,074 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:26,074 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:26,074 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:26,074 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:26,074 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:26,074 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:26,074 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 46 states have (on average 1.3478260869565217) internal successors, (in total 62), 51 states have internal predecessors, (62), 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:38:26,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:26,077 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:26,077 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:26,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:26,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:26,077 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:26,077 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 46 states have (on average 1.3478260869565217) internal successors, (in total 62), 51 states have internal predecessors, (62), 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:38:26,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:26,079 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:26,079 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:26,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:26,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:26,080 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[39] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[54] L30-->$Ultimate##0: Formula: (= v_threadThread1of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_11) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_11} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_11} AuxVars[] AssignedVars[threadThread1of2ForFork0_thidvar0]" "[37] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[55] L30-->$Ultimate##0: Formula: (= v_threadThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_13) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_13} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_13, threadThread2of2ForFork0_thidvar0=v_threadThread2of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of2ForFork0_thidvar0]" "[37] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[52] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[48] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[50] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:26,080 INFO L754 eck$LassoCheckResult]: Loop: "[53] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:26,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1633377337, now seen corresponding path program 1 times [2025-04-26 18:38:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043785028] [2025-04-26 18:38:26,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:26,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:26,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:26,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:26,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 84, now seen corresponding path program 1 times [2025-04-26 18:38:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215935934] [2025-04-26 18:38:26,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:26,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:26,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:26,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:26,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash 904910158, now seen corresponding path program 1 times [2025-04-26 18:38:26,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938080417] [2025-04-26 18:38:26,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:26,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:26,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:26,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:26,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:26,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:26,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:26,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:26,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,235 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:26,240 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:26,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2025-04-26 18:38:26,250 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:26,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:26,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:26,255 INFO L229 MonitoredProcess]: Starting monitored process 4 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:38:26,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2025-04-26 18:38:26,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 56 flow [2025-04-26 18:38:26,277 INFO L116 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-04-26 18:38:26,277 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 18:38:26,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 1/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2025-04-26 18:38:26,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 19 transitions, 56 flow [2025-04-26 18:38:26,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 19 transitions, 56 flow [2025-04-26 18:38:26,278 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 19 transitions, 56 flow [2025-04-26 18:38:26,278 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 19 transitions, 56 flow [2025-04-26 18:38:26,307 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 308 states, 300 states have (on average 2.7933333333333334) internal successors, (in total 838), 307 states have internal predecessors, (838), 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:38:26,308 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 308 states, 300 states have (on average 2.7933333333333334) internal successors, (in total 838), 307 states have internal predecessors, (838), 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:38:26,308 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:26,350 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 464#[threadFINAL, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL]true [2025-04-26 18:38:26,350 WARN L140 AmpleReduction]: Number of pruned transitions: 146 [2025-04-26 18:38:26,351 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:26,351 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:26,351 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:42 [2025-04-26 18:38:26,351 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:79 [2025-04-26 18:38:26,351 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:26,351 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:26,351 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:26,351 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 122 states, 114 states have (on average 1.3421052631578947) internal successors, (in total 153), 121 states have internal predecessors, (153), 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:38:26,351 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:26,351 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:26,351 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:26,355 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:26,356 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:26,356 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:26,356 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:26,356 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:26,356 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 114 states have (on average 1.3421052631578947) internal successors, (in total 153), 121 states have internal predecessors, (153), 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:38:26,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:26,359 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:26,359 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:26,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:26,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:26,359 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:26,359 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 114 states have (on average 1.3421052631578947) internal successors, (in total 153), 121 states have internal predecessors, (153), 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:38:26,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:26,380 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:26,380 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:26,380 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:26,380 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:26,381 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[74] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[79] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[91] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_18 v_threadThread1of3ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_18} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_18, threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of3ForFork0_thidvar0]" "[72] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[79] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[92] L30-->$Ultimate##0: Formula: (= v_threadThread2of3ForFork0_thidvar0_2 v_ULTIMATE.start_i_20) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_20} OutVars{threadThread2of3ForFork0_thidvar0=v_threadThread2of3ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_20} AuxVars[] AssignedVars[threadThread2of3ForFork0_thidvar0]" "[72] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[79] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[93] L30-->$Ultimate##0: Formula: (= v_threadThread3of3ForFork0_thidvar0_2 v_ULTIMATE.start_i_22) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_22} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_22, threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of3ForFork0_thidvar0]" "[72] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[79] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[89] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[87] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[85] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[83] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:26,381 INFO L754 eck$LassoCheckResult]: Loop: "[90] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:26,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash -22497362, now seen corresponding path program 1 times [2025-04-26 18:38:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218546954] [2025-04-26 18:38:26,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:26,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:26,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:26,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash 121, now seen corresponding path program 1 times [2025-04-26 18:38:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406713901] [2025-04-26 18:38:26,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:26,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:26,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:26,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:26,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash -697418132, now seen corresponding path program 1 times [2025-04-26 18:38:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319170890] [2025-04-26 18:38:26,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:26,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:26,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,412 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:26,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:26,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:26,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:26,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:26,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:26,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,512 WARN L166 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:26,515 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:26,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:26,525 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:26,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:26,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:26,527 INFO L229 MonitoredProcess]: Starting monitored process 5 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:38:26,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2025-04-26 18:38:26,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 72 flow [2025-04-26 18:38:26,546 INFO L116 PetriNetUnfolderBase]: 1/45 cut-off events. [2025-04-26 18:38:26,546 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-26 18:38:26,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 45 events. 1/45 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2025-04-26 18:38:26,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 22 transitions, 72 flow [2025-04-26 18:38:26,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 22 transitions, 72 flow [2025-04-26 18:38:26,547 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 22 transitions, 72 flow [2025-04-26 18:38:26,547 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 22 transitions, 72 flow [2025-04-26 18:38:26,576 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 929 states, 919 states have (on average 3.4091403699673557) internal successors, (in total 3133), 928 states have internal predecessors, (3133), 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:38:26,577 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 929 states, 919 states have (on average 3.4091403699673557) internal successors, (in total 3133), 928 states have internal predecessors, (3133), 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:38:26,577 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:26,671 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1435#[threadFINAL, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL, threadFINAL]true [2025-04-26 18:38:26,671 WARN L140 AmpleReduction]: Number of pruned transitions: 468 [2025-04-26 18:38:26,671 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:26,671 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:26,671 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:71 [2025-04-26 18:38:26,671 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:212 [2025-04-26 18:38:26,671 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:26,671 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:26,671 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:26,672 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 284 states, 274 states have (on average 1.332116788321168) internal successors, (in total 365), 283 states have internal predecessors, (365), 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:38:26,672 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:26,672 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:26,672 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:26,672 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:26,672 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:26,672 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:26,672 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:26,672 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:26,677 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 284 states, 274 states have (on average 1.332116788321168) internal successors, (in total 365), 283 states have internal predecessors, (365), 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:38:26,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:26,681 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:26,681 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:26,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:26,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:26,682 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:26,682 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 284 states, 274 states have (on average 1.332116788321168) internal successors, (in total 365), 283 states have internal predecessors, (365), 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:38:26,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:26,689 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:26,689 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:26,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:26,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:26,698 INFO L752 eck$LassoCheckResult]: Stem: "[129] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[126] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[145] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_28 v_threadThread1of4ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_28} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_28, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of4ForFork0_thidvar0]" "[124] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[146] L30-->$Ultimate##0: Formula: (= v_threadThread2of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_30) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_30} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_30, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of4ForFork0_thidvar0]" "[124] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[147] L30-->$Ultimate##0: Formula: (= v_threadThread3of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_32) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_32} OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_32} AuxVars[] AssignedVars[threadThread3of4ForFork0_thidvar0]" "[124] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[148] L30-->$Ultimate##0: Formula: (= v_threadThread4of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_34) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_34} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_34, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread4of4ForFork0_thidvar0]" "[124] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[143] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[137] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[135] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[139] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:26,698 INFO L754 eck$LassoCheckResult]: Loop: "[144] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:26,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 317927048, now seen corresponding path program 1 times [2025-04-26 18:38:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150027385] [2025-04-26 18:38:26,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:38:26,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:38:26,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:38:26,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:38:26,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,736 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2025-04-26 18:38:26,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076630809] [2025-04-26 18:38:26,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:26,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:26,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:26,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:26,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1265804040, now seen corresponding path program 1 times [2025-04-26 18:38:26,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109401204] [2025-04-26 18:38:26,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:38:26,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:38:26,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:38:26,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:38:26,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:38:26,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:38:26,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:38:26,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:38:26,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,865 WARN L166 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:26,868 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:26,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:26,876 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:26,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:26,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:26,878 INFO L229 MonitoredProcess]: Starting monitored process 6 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:38:26,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2025-04-26 18:38:26,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 90 flow [2025-04-26 18:38:26,907 INFO L116 PetriNetUnfolderBase]: 1/54 cut-off events. [2025-04-26 18:38:26,907 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-26 18:38:26,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 54 events. 1/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2025-04-26 18:38:26,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 25 transitions, 90 flow [2025-04-26 18:38:26,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 25 transitions, 90 flow [2025-04-26 18:38:26,909 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 25 transitions, 90 flow [2025-04-26 18:38:26,909 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 90 flow [2025-04-26 18:38:26,982 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2792 states, 2780 states have (on average 4.0503597122302155) internal successors, (in total 11260), 2791 states have internal predecessors, (11260), 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:38:26,991 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 2792 states, 2780 states have (on average 4.0503597122302155) internal successors, (in total 11260), 2791 states have internal predecessors, (11260), 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:38:26,992 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:27,100 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4210#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL, threadFINAL, threadFINAL, threadFINAL]true [2025-04-26 18:38:27,100 WARN L140 AmpleReduction]: Number of pruned transitions: 1386 [2025-04-26 18:38:27,100 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:27,100 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:27,100 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:119 [2025-04-26 18:38:27,100 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:534 [2025-04-26 18:38:27,100 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:27,100 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:27,100 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:27,101 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 654 states, 642 states have (on average 1.32398753894081) internal successors, (in total 850), 653 states have internal predecessors, (850), 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:38:27,102 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:27,102 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:27,102 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:27,102 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:27,102 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:27,102 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:27,102 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:27,102 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:27,103 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 654 states, 642 states have (on average 1.32398753894081) internal successors, (in total 850), 653 states have internal predecessors, (850), 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:38:27,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:27,110 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:27,110 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:27,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:27,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:27,111 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:27,112 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 654 states, 642 states have (on average 1.32398753894081) internal successors, (in total 850), 653 states have internal predecessors, (850), 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:38:27,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:27,131 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:27,131 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:27,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:27,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:27,133 INFO L752 eck$LassoCheckResult]: Stem: "[202] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[199] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[220] L30-->$Ultimate##0: Formula: (= v_threadThread1of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_41) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_41} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_41, threadThread1of5ForFork0_thidvar0=v_threadThread1of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[221] L30-->$Ultimate##0: Formula: (= v_threadThread2of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_43) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_43} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_43, threadThread2of5ForFork0_thidvar0=v_threadThread2of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[222] L30-->$Ultimate##0: Formula: (= v_threadThread3of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_45) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_45} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_45, threadThread3of5ForFork0_thidvar0=v_threadThread3of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[223] L30-->$Ultimate##0: Formula: (= v_threadThread4of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_47) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_47} OutVars{threadThread4of5ForFork0_thidvar0=v_threadThread4of5ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_47} AuxVars[] AssignedVars[threadThread4of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[224] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_49 v_threadThread5of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_49} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_49, threadThread5of5ForFork0_thidvar0=v_threadThread5of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread5of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[218] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[208] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[210] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[212] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[216] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[214] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:27,133 INFO L754 eck$LassoCheckResult]: Loop: "[219] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:27,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -901387539, now seen corresponding path program 1 times [2025-04-26 18:38:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:27,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455332187] [2025-04-26 18:38:27,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:27,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:38:27,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:38:27,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:27,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:27,254 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:38:27,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:27,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455332187] [2025-04-26 18:38:27,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455332187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:27,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:27,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-26 18:38:27,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81053451] [2025-04-26 18:38:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:27,262 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:27,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash 250, now seen corresponding path program 1 times [2025-04-26 18:38:27,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:27,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017661885] [2025-04-26 18:38:27,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:27,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:27,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:27,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:27,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:27,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:27,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:27,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:27,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:27,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:27,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:27,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 18:38:27,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-26 18:38:27,285 INFO L87 Difference]: Start difference. First operand has 654 states, 642 states have (on average 1.32398753894081) internal successors, (in total 850), 653 states have internal predecessors, (850), 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 8 states, 8 states have (on average 3.0) internal successors, (in total 24), 8 states have internal predecessors, (24), 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:38:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:27,330 INFO L93 Difference]: Finished difference Result 647 states and 842 transitions. [2025-04-26 18:38:27,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 647 states and 842 transitions. [2025-04-26 18:38:27,338 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:27,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 647 states to 0 states and 0 transitions. [2025-04-26 18:38:27,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:38:27,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:38:27,344 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:38:27,344 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:27,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:27,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:27,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 18:38:27,351 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:27,351 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:27,351 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:38:27,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:27,351 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:38:27,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2025-04-26 18:38:27,360 INFO L201 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:27 BoogieIcfgContainer [2025-04-26 18:38:27,360 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:27,361 INFO L158 Benchmark]: Toolchain (without parser) took 1914.76ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 82.3MB in the end (delta: -667.2kB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. [2025-04-26 18:38:27,361 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.80ms. Allocated memory is still 155.2MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:27,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.38ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 79.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:27,362 INFO L158 Benchmark]: Boogie Preprocessor took 21.16ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 78.9MB in the end (delta: 914.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:38:27,362 INFO L158 Benchmark]: RCFGBuilder took 133.19ms. Allocated memory is still 155.2MB. Free memory was 78.7MB in the beginning and 70.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:27,362 INFO L158 Benchmark]: BuchiAutomizer took 1722.13ms. Allocated memory is still 155.2MB. Free memory was 70.3MB in the beginning and 82.3MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:27,363 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.80ms. Allocated memory is still 155.2MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.38ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 79.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.16ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 78.9MB in the end (delta: 914.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 133.19ms. Allocated memory is still 155.2MB. Free memory was 78.7MB in the beginning and 70.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1722.13ms. Allocated memory is still 155.2MB. Free memory was 70.3MB in the beginning and 82.3MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.2s and 1 iterations. TraceHistogramMax:2. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 105, Number of transitions in reduction automaton: 24, Number of states in reduction automaton: 22, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.2s and 1 iterations. TraceHistogramMax:3. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 55, Number of transitions in reduction automaton: 62, Number of states in reduction automaton: 52, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.2s and 1 iterations. TraceHistogramMax:4. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 107, Number of transitions in reduction automaton: 153, Number of states in reduction automaton: 122, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 1 iterations. TraceHistogramMax:5. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 153, Number of transitions in reduction automaton: 365, Number of states in reduction automaton: 284, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s and 2 iterations. TraceHistogramMax:6. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 15 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 229, Number of transitions in reduction automaton: 850, Number of states in reduction automaton: 654, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:38:27,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...