Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926500107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MedleyA-PT-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-22-LTLCardinality-00
FORMULA_NAME MedleyA-PT-22-LTLCardinality-01
FORMULA_NAME MedleyA-PT-22-LTLCardinality-02
FORMULA_NAME MedleyA-PT-22-LTLCardinality-03
FORMULA_NAME MedleyA-PT-22-LTLCardinality-04
FORMULA_NAME MedleyA-PT-22-LTLCardinality-05
FORMULA_NAME MedleyA-PT-22-LTLCardinality-06
FORMULA_NAME MedleyA-PT-22-LTLCardinality-07
FORMULA_NAME MedleyA-PT-22-LTLCardinality-08
FORMULA_NAME MedleyA-PT-22-LTLCardinality-09
FORMULA_NAME MedleyA-PT-22-LTLCardinality-10
FORMULA_NAME MedleyA-PT-22-LTLCardinality-11
FORMULA_NAME MedleyA-PT-22-LTLCardinality-12
FORMULA_NAME MedleyA-PT-22-LTLCardinality-13
FORMULA_NAME MedleyA-PT-22-LTLCardinality-14
FORMULA_NAME MedleyA-PT-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717367512754

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:31:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:31:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:31:56] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2024-06-02 22:31:56] [INFO ] Transformed 307 places.
[2024-06-02 22:31:56] [INFO ] Transformed 740 transitions.
[2024-06-02 22:31:56] [INFO ] Found NUPN structural information;
[2024-06-02 22:31:56] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 482 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-22-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 95 place count 212 transition count 633
Iterating global reduction 1 with 91 rules applied. Total rules applied 186 place count 212 transition count 633
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 194 place count 212 transition count 625
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 217 place count 189 transition count 569
Iterating global reduction 2 with 23 rules applied. Total rules applied 240 place count 189 transition count 569
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 181 transition count 551
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 181 transition count 551
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 261 place count 176 transition count 536
Iterating global reduction 2 with 5 rules applied. Total rules applied 266 place count 176 transition count 536
Applied a total of 266 rules in 117 ms. Remains 176 /307 variables (removed 131) and now considering 536/740 (removed 204) transitions.
// Phase 1: matrix 536 rows 176 cols
[2024-06-02 22:31:56] [INFO ] Computed 22 invariants in 31 ms
[2024-06-02 22:31:57] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-06-02 22:31:57] [INFO ] Invariant cache hit.
[2024-06-02 22:31:57] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2024-06-02 22:31:57] [INFO ] Invariant cache hit.
[2024-06-02 22:31:58] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 144 transitions.
Found 144 dead transitions using SMT.
Drop transitions removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 176/307 places, 392/740 transitions.
Applied a total of 0 rules in 9 ms. Remains 176 /176 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1733 ms. Remains : 176/307 places, 392/740 transitions.
Support contains 15 out of 176 places after structural reductions.
[2024-06-02 22:31:58] [INFO ] Flatten gal took : 135 ms
[2024-06-02 22:31:58] [INFO ] Flatten gal took : 53 ms
[2024-06-02 22:31:58] [INFO ] Input system was already deterministic with 392 transitions.
Incomplete random walk after 10000 steps, including 284 resets, run finished after 825 ms. (steps per millisecond=12 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 392 rows 176 cols
[2024-06-02 22:32:00] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 22:32:00] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 22:32:00] [INFO ] [Real]Absence check using 6 positive and 16 generalized place invariants in 7 ms returned sat
[2024-06-02 22:32:00] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 22:32:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 22:32:00] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 8 ms returned sat
[2024-06-02 22:32:01] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 22:32:01] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 196 ms.
[2024-06-02 22:32:01] [INFO ] After 1060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 4 properties in 67 ms.
Support contains 9 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 392/392 transitions.
Graph (complete) has 748 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 175 transition count 366
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 151 transition count 364
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 149 transition count 364
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 54 place count 149 transition count 360
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 62 place count 145 transition count 360
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 143 transition count 355
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 143 transition count 355
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 143 transition count 354
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 142 transition count 354
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 141 transition count 351
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 141 transition count 351
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 120 place count 115 transition count 327
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 112 transition count 324
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 112 transition count 324
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 144 place count 103 transition count 407
Drop transitions removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 3 with 77 rules applied. Total rules applied 221 place count 103 transition count 330
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 103 transition count 326
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 229 place count 99 transition count 326
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 4 with 19 rules applied. Total rules applied 248 place count 99 transition count 547
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 299 place count 80 transition count 515
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 300 place count 79 transition count 514
Applied a total of 300 rules in 218 ms. Remains 79 /176 variables (removed 97) and now considering 514/392 (removed -122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 79/176 places, 514/392 transitions.
Finished random walk after 3775 steps, including 636 resets, run visited all 5 properties in 93 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-22-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 748 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 167 transition count 378
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 167 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 167 transition count 377
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 162 transition count 360
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 162 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 160 transition count 354
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 160 transition count 354
Applied a total of 33 rules in 18 ms. Remains 160 /176 variables (removed 16) and now considering 354/392 (removed 38) transitions.
// Phase 1: matrix 354 rows 160 cols
[2024-06-02 22:32:02] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 22:32:02] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-02 22:32:02] [INFO ] Invariant cache hit.
[2024-06-02 22:32:02] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-06-02 22:32:02] [INFO ] Invariant cache hit.
[2024-06-02 22:32:03] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 160/176 places, 354/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 160/176 places, 354/392 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s114 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-22-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLCardinality-01 finished in 1152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(F(p2)||p1)))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 169 transition count 383
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 169 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 169 transition count 382
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 165 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 165 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 163 transition count 362
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 163 transition count 362
Applied a total of 27 rules in 16 ms. Remains 163 /176 variables (removed 13) and now considering 362/392 (removed 30) transitions.
// Phase 1: matrix 362 rows 163 cols
[2024-06-02 22:32:03] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 22:32:03] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-02 22:32:03] [INFO ] Invariant cache hit.
[2024-06-02 22:32:03] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-06-02 22:32:03] [INFO ] Invariant cache hit.
[2024-06-02 22:32:04] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 362/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 787 ms. Remains : 163/176 places, 362/392 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s98 0) (EQ s93 1)), p1:(OR (EQ s98 0) (EQ s93 1)), p2:(OR (EQ s45 0) (EQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2928 reset in 386 ms.
Product exploration explored 100000 steps with 2910 reset in 354 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 695 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 289 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 463976 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463976 steps, saw 93916 distinct states, run finished after 3003 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 6 properties.
[2024-06-02 22:32:09] [INFO ] Invariant cache hit.
[2024-06-02 22:32:09] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-06-02 22:32:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 22:32:09] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 9 ms returned sat
[2024-06-02 22:32:09] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-06-02 22:32:09] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-06-02 22:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-06-02 22:32:10] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-06-02 22:32:10] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 22 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 362/362 transitions.
Graph (complete) has 695 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 162 transition count 334
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 136 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 135 transition count 333
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 56 place count 135 transition count 327
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 68 place count 129 transition count 327
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 114 place count 105 transition count 305
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 102 transition count 302
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 102 transition count 302
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 130 place count 97 transition count 332
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 152 place count 97 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 96 transition count 322
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 160 place count 96 transition count 316
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 166 place count 90 transition count 316
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 184 place count 90 transition count 537
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 50 rules applied. Total rules applied 234 place count 72 transition count 505
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 71 transition count 504
Applied a total of 235 rules in 115 ms. Remains 71 /163 variables (removed 92) and now considering 504/362 (removed -142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 71/163 places, 504/362 transitions.
Finished random walk after 5599 steps, including 921 resets, run visited all 3 properties in 106 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 339 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 362/362 transitions.
Graph (complete) has 695 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 161 transition count 335
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 136 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 135 transition count 334
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 53 place count 135 transition count 327
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 128 transition count 327
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 109 place count 106 transition count 307
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 103 transition count 304
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 103 transition count 304
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 127 place count 97 transition count 334
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 149 place count 97 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 96 transition count 324
Applied a total of 151 rules in 67 ms. Remains 96 /163 variables (removed 67) and now considering 324/362 (removed 38) transitions.
// Phase 1: matrix 324 rows 96 cols
[2024-06-02 22:32:10] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 22:32:11] [INFO ] Implicit Places using invariants in 96 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/163 places, 324/362 transitions.
Applied a total of 0 rules in 12 ms. Remains 95 /95 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 95/163 places, 324/362 transitions.
Computed a total of 13 stabilizing places and 169 stable transitions
Computed a total of 13 stabilizing places and 169 stable transitions
Detected a total of 13/95 stabilizing places and 169/324 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1158 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1264499 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :{}
Probabilistic random walk after 1264499 steps, saw 203019 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 324 rows 95 cols
[2024-06-02 22:32:14] [INFO ] Computed 19 invariants in 8 ms
[2024-06-02 22:32:14] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:32:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-02 22:32:14] [INFO ] [Nat]Absence check using 12 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-02 22:32:14] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:32:14] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-02 22:32:14] [INFO ] After 50ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:32:14] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-06-02 22:32:14] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 324/324 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 95 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 94 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 94 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 93 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 93 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 92 transition count 311
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 86 transition count 305
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 37 place count 86 transition count 494
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 83 place count 68 transition count 466
Applied a total of 83 rules in 51 ms. Remains 68 /95 variables (removed 27) and now considering 466/324 (removed -142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 68/95 places, 466/324 transitions.
Finished random walk after 893 steps, including 156 resets, run visited all 1 properties in 7 ms. (steps per millisecond=127 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11707 reset in 407 ms.
Product exploration explored 100000 steps with 11748 reset in 497 ms.
Built C files in :
/tmp/ltsmin11564439632183433874
[2024-06-02 22:32:15] [INFO ] Computing symmetric may disable matrix : 324 transitions.
[2024-06-02 22:32:15] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:32:15] [INFO ] Computing symmetric may enable matrix : 324 transitions.
[2024-06-02 22:32:16] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:32:16] [INFO ] Computing Do-Not-Accords matrix : 324 transitions.
[2024-06-02 22:32:16] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:32:16] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11564439632183433874
Running compilation step : cd /tmp/ltsmin11564439632183433874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1450 ms.
Running link step : cd /tmp/ltsmin11564439632183433874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin11564439632183433874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4548968148159699966.hoa' '--buchi-type=spotba'
LTSmin run took 869 ms.
FORMULA MedleyA-PT-22-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-22-LTLCardinality-03 finished in 15098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 168 transition count 379
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 168 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 168 transition count 378
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 163 transition count 361
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 163 transition count 361
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 161 transition count 355
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 161 transition count 355
Applied a total of 31 rules in 9 ms. Remains 161 /176 variables (removed 15) and now considering 355/392 (removed 37) transitions.
// Phase 1: matrix 355 rows 161 cols
[2024-06-02 22:32:18] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 22:32:18] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-02 22:32:18] [INFO ] Invariant cache hit.
[2024-06-02 22:32:18] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-06-02 22:32:18] [INFO ] Invariant cache hit.
[2024-06-02 22:32:19] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 161/176 places, 355/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 161/176 places, 355/392 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 684 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-22-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLCardinality-07 finished in 1476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 169 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 169 transition count 380
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 165 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 165 transition count 366
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 163 transition count 360
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 163 transition count 360
Applied a total of 26 rules in 8 ms. Remains 163 /176 variables (removed 13) and now considering 360/392 (removed 32) transitions.
// Phase 1: matrix 360 rows 163 cols
[2024-06-02 22:32:19] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 22:32:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 22:32:20] [INFO ] Invariant cache hit.
[2024-06-02 22:32:20] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-06-02 22:32:20] [INFO ] Invariant cache hit.
[2024-06-02 22:32:20] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 360/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 163/176 places, 360/392 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s56 0) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 691 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-22-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLCardinality-08 finished in 1257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 168 transition count 380
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 168 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 168 transition count 379
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 164 transition count 366
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 164 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 163 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 163 transition count 363
Applied a total of 27 rules in 9 ms. Remains 163 /176 variables (removed 13) and now considering 363/392 (removed 29) transitions.
// Phase 1: matrix 363 rows 163 cols
[2024-06-02 22:32:21] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 22:32:21] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 22:32:21] [INFO ] Invariant cache hit.
[2024-06-02 22:32:21] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-06-02 22:32:21] [INFO ] Invariant cache hit.
[2024-06-02 22:32:21] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 363/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 163/176 places, 363/392 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s67 0) (NEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLCardinality-10 finished in 870 ms.
All properties solved by simple procedures.
Total runtime 26391 ms.

BK_STOP 1717367543176

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-22"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-22, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r597-smll-171734926500107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;