Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856100595.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FlexibleBarrier-PT-22b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856100595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:22 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 FlexibleBarrier-PT-22b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678581530954

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 00:38:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 00:38:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:38:52] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2023-03-12 00:38:52] [INFO ] Transformed 6478 places.
[2023-03-12 00:38:52] [INFO ] Transformed 7469 transitions.
[2023-03-12 00:38:52] [INFO ] Found NUPN structural information;
[2023-03-12 00:38:52] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 6478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Discarding 2751 places :
Symmetric choice reduction at 0 with 2751 rule applications. Total rules 2751 place count 3727 transition count 4718
Iterating global reduction 0 with 2751 rules applied. Total rules applied 5502 place count 3727 transition count 4718
Discarding 1318 places :
Symmetric choice reduction at 0 with 1318 rule applications. Total rules 6820 place count 2409 transition count 3400
Iterating global reduction 0 with 1318 rules applied. Total rules applied 8138 place count 2409 transition count 3400
Discarding 860 places :
Symmetric choice reduction at 0 with 860 rule applications. Total rules 8998 place count 1549 transition count 2540
Iterating global reduction 0 with 860 rules applied. Total rules applied 9858 place count 1549 transition count 2540
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Iterating post reduction 0 with 421 rules applied. Total rules applied 10279 place count 1549 transition count 2119
Applied a total of 10279 rules in 1364 ms. Remains 1549 /6478 variables (removed 4929) and now considering 2119/7469 (removed 5350) transitions.
// Phase 1: matrix 2119 rows 1549 cols
[2023-03-12 00:38:54] [INFO ] Computed 24 place invariants in 86 ms
[2023-03-12 00:38:55] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-12 00:38:55] [INFO ] Invariant cache hit.
[2023-03-12 00:38:57] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2545 ms to find 0 implicit places.
[2023-03-12 00:38:57] [INFO ] Invariant cache hit.
[2023-03-12 00:38:58] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1549/6478 places, 2119/7469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4849 ms. Remains : 1549/6478 places, 2119/7469 transitions.
Support contains 28 out of 1549 places after structural reductions.
[2023-03-12 00:38:58] [INFO ] Flatten gal took : 151 ms
[2023-03-12 00:38:58] [INFO ] Flatten gal took : 92 ms
[2023-03-12 00:38:58] [INFO ] Input system was already deterministic with 2119 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 00:38:59] [INFO ] Invariant cache hit.
[2023-03-12 00:38:59] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 00:39:00] [INFO ] [Nat]Absence check using 24 positive place invariants in 21 ms returned sat
[2023-03-12 00:39:01] [INFO ] After 1023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 00:39:02] [INFO ] Deduced a trap composed of 499 places in 526 ms of which 12 ms to minimize.
[2023-03-12 00:39:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
[2023-03-12 00:39:02] [INFO ] After 2304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-12 00:39:02] [INFO ] After 3172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 2 properties in 119 ms.
Support contains 11 out of 1549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1549/1549 places, 2119/2119 transitions.
Graph (trivial) has 1468 edges and 1549 vertex of which 133 / 1549 are part of one of the 22 SCC in 6 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 1438 transition count 1881
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 1334 transition count 1881
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 209 place count 1334 transition count 1831
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 309 place count 1284 transition count 1831
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 365 place count 1228 transition count 1775
Iterating global reduction 2 with 56 rules applied. Total rules applied 421 place count 1228 transition count 1775
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 425 place count 1228 transition count 1771
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 433 place count 1220 transition count 1763
Iterating global reduction 3 with 8 rules applied. Total rules applied 441 place count 1220 transition count 1763
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 446 place count 1220 transition count 1758
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 718 place count 1084 transition count 1622
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 762 place count 1084 transition count 1578
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 786 place count 1060 transition count 1554
Iterating global reduction 5 with 24 rules applied. Total rules applied 810 place count 1060 transition count 1554
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 812 place count 1060 transition count 1552
Free-agglomeration rule applied 934 times.
Iterating global reduction 6 with 934 rules applied. Total rules applied 1746 place count 1060 transition count 618
Reduce places removed 934 places and 0 transitions.
Drop transitions removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Graph (complete) has 356 edges and 126 vertex of which 81 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1374 rules applied. Total rules applied 3120 place count 81 transition count 179
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 7 with 63 rules applied. Total rules applied 3183 place count 81 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3184 place count 80 transition count 115
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 65 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 3186 place count 66 transition count 115
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 3212 place count 66 transition count 89
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 13 Pre rules applied. Total rules applied 3212 place count 66 transition count 76
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 3238 place count 53 transition count 76
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 3251 place count 53 transition count 63
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 3277 place count 40 transition count 50
Free-agglomeration rule applied 13 times.
Iterating global reduction 11 with 13 rules applied. Total rules applied 3290 place count 40 transition count 37
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 35 rules applied. Total rules applied 3325 place count 18 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3326 place count 18 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 3327 place count 17 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 3328 place count 17 transition count 22
Applied a total of 3328 rules in 951 ms. Remains 17 /1549 variables (removed 1532) and now considering 22/2119 (removed 2097) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 951 ms. Remains : 17/1549 places, 22/2119 transitions.
Finished random walk after 29 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=29 )
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 24 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1549/1549 places, 2119/2119 transitions.
Graph (trivial) has 1478 edges and 1549 vertex of which 133 / 1549 are part of one of the 22 SCC in 3 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 1437 transition count 1902
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 1333 transition count 1902
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 209 place count 1333 transition count 1849
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 315 place count 1280 transition count 1849
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 379 place count 1216 transition count 1785
Iterating global reduction 2 with 64 rules applied. Total rules applied 443 place count 1216 transition count 1785
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 447 place count 1216 transition count 1781
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 460 place count 1203 transition count 1768
Iterating global reduction 3 with 13 rules applied. Total rules applied 473 place count 1203 transition count 1768
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 485 place count 1203 transition count 1756
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 753 place count 1069 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 755 place count 1067 transition count 1620
Iterating global reduction 4 with 2 rules applied. Total rules applied 757 place count 1067 transition count 1620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 759 place count 1067 transition count 1618
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 781 place count 1067 transition count 1596
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 783 place count 1065 transition count 1594
Applied a total of 783 rules in 1014 ms. Remains 1065 /1549 variables (removed 484) and now considering 1594/2119 (removed 525) transitions.
[2023-03-12 00:39:05] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
// Phase 1: matrix 1551 rows 1065 cols
[2023-03-12 00:39:05] [INFO ] Computed 24 place invariants in 69 ms
[2023-03-12 00:39:05] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-12 00:39:05] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:05] [INFO ] Invariant cache hit.
[2023-03-12 00:39:07] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2023-03-12 00:39:07] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-12 00:39:07] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:07] [INFO ] Invariant cache hit.
[2023-03-12 00:39:07] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1065/1549 places, 1594/2119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3652 ms. Remains : 1065/1549 places, 1594/2119 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s505 0) (EQ s608 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3520 reset in 1636 ms.
Product exploration explored 100000 steps with 3518 reset in 1503 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 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 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 357 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403925 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403925 steps, saw 106600 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 00:39:14] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:14] [INFO ] Invariant cache hit.
[2023-03-12 00:39:14] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 00:39:15] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2023-03-12 00:39:15] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 00:39:15] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-12 00:39:15] [INFO ] After 838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 1594/1594 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1065 transition count 1550
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1043 transition count 1528
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1043 transition count 1528
Free-agglomeration rule applied 928 times.
Iterating global reduction 1 with 928 rules applied. Total rules applied 1016 place count 1043 transition count 600
Discarding 95 places :
Also discarding 475 output transitions
Drop transitions removed 475 transitions
Remove reverse transitions (loop back) rule discarded transition t460.t1603.t1446 and 95 places that fell out of Prefix Of Interest.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (trivial) has 21 edges and 18 vertex of which 15 / 18 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 1 with 101 rules applied. Total rules applied 1117 place count 6 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1139 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1139 place count 5 transition count 4
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 1141 place count 4 transition count 4
Applied a total of 1141 rules in 229 ms. Remains 4 /1065 variables (removed 1061) and now considering 4/1594 (removed 1590) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 4/1065 places, 4/1594 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1065/1065 places, 1594/1594 transitions.
Applied a total of 0 rules in 128 ms. Remains 1065 /1065 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2023-03-12 00:39:16] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:16] [INFO ] Invariant cache hit.
[2023-03-12 00:39:17] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-12 00:39:17] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:17] [INFO ] Invariant cache hit.
[2023-03-12 00:39:18] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2023-03-12 00:39:18] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-12 00:39:18] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:18] [INFO ] Invariant cache hit.
[2023-03-12 00:39:19] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2694 ms. Remains : 1065/1065 places, 1594/1594 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 359 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 395339 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395339 steps, saw 104244 distinct states, run finished after 3004 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 00:39:22] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:22] [INFO ] Invariant cache hit.
[2023-03-12 00:39:22] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 00:39:23] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2023-03-12 00:39:23] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 00:39:23] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-12 00:39:23] [INFO ] After 814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 1594/1594 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1065 transition count 1550
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1043 transition count 1528
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1043 transition count 1528
Free-agglomeration rule applied 928 times.
Iterating global reduction 1 with 928 rules applied. Total rules applied 1016 place count 1043 transition count 600
Discarding 95 places :
Also discarding 475 output transitions
Drop transitions removed 475 transitions
Remove reverse transitions (loop back) rule discarded transition t460.t1603.t1446 and 95 places that fell out of Prefix Of Interest.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (trivial) has 21 edges and 18 vertex of which 15 / 18 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 1 with 101 rules applied. Total rules applied 1117 place count 6 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1139 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1139 place count 5 transition count 4
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 1141 place count 4 transition count 4
Applied a total of 1141 rules in 222 ms. Remains 4 /1065 variables (removed 1061) and now considering 4/1594 (removed 1590) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 4/1065 places, 4/1594 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3523 reset in 1424 ms.
Product exploration explored 100000 steps with 3520 reset in 1433 ms.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1065/1065 places, 1594/1594 transitions.
Applied a total of 0 rules in 124 ms. Remains 1065 /1065 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2023-03-12 00:39:27] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:27] [INFO ] Invariant cache hit.
[2023-03-12 00:39:27] [INFO ] Implicit Places using invariants in 633 ms returned []
[2023-03-12 00:39:27] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:27] [INFO ] Invariant cache hit.
[2023-03-12 00:39:29] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2023-03-12 00:39:29] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 00:39:29] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2023-03-12 00:39:29] [INFO ] Invariant cache hit.
[2023-03-12 00:39:29] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2739 ms. Remains : 1065/1065 places, 1594/1594 transitions.
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-00 finished in 25831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((p1&&F(p2)))))))'
Support contains 6 out of 1549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1549/1549 places, 2119/2119 transitions.
Graph (trivial) has 1473 edges and 1549 vertex of which 133 / 1549 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1437 transition count 1904
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1335 transition count 1904
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 205 place count 1335 transition count 1851
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 311 place count 1282 transition count 1851
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 372 place count 1221 transition count 1790
Iterating global reduction 2 with 61 rules applied. Total rules applied 433 place count 1221 transition count 1790
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 435 place count 1221 transition count 1788
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 448 place count 1208 transition count 1775
Iterating global reduction 3 with 13 rules applied. Total rules applied 461 place count 1208 transition count 1775
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 473 place count 1208 transition count 1763
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 741 place count 1074 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 742 place count 1073 transition count 1628
Iterating global reduction 4 with 1 rules applied. Total rules applied 743 place count 1073 transition count 1628
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 744 place count 1073 transition count 1627
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 766 place count 1073 transition count 1605
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 768 place count 1071 transition count 1603
Applied a total of 768 rules in 610 ms. Remains 1071 /1549 variables (removed 478) and now considering 1603/2119 (removed 516) transitions.
[2023-03-12 00:39:30] [INFO ] Flow matrix only has 1560 transitions (discarded 43 similar events)
// Phase 1: matrix 1560 rows 1071 cols
[2023-03-12 00:39:30] [INFO ] Computed 24 place invariants in 46 ms
[2023-03-12 00:39:31] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-12 00:39:31] [INFO ] Flow matrix only has 1560 transitions (discarded 43 similar events)
[2023-03-12 00:39:31] [INFO ] Invariant cache hit.
[2023-03-12 00:39:32] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2023-03-12 00:39:32] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 00:39:32] [INFO ] Flow matrix only has 1560 transitions (discarded 43 similar events)
[2023-03-12 00:39:32] [INFO ] Invariant cache hit.
[2023-03-12 00:39:33] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1071/1549 places, 1603/2119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3218 ms. Remains : 1071/1549 places, 1603/2119 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s265 0) (EQ s287 1)), p1:(OR (EQ s495 0) (EQ s480 1)), p2:(OR (EQ s310 0) (EQ s728 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 207 steps with 7 reset in 5 ms.
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-04 finished in 3397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1))))'
Support contains 4 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 2119/2119 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1530 transition count 2100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1530 transition count 2100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 1530 transition count 2097
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 1515 transition count 2082
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 1515 transition count 2082
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 1515 transition count 2071
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 1512 transition count 2068
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 1512 transition count 2068
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 1512 transition count 2065
Applied a total of 91 rules in 222 ms. Remains 1512 /1549 variables (removed 37) and now considering 2065/2119 (removed 54) transitions.
// Phase 1: matrix 2065 rows 1512 cols
[2023-03-12 00:39:33] [INFO ] Computed 24 place invariants in 42 ms
[2023-03-12 00:39:34] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-12 00:39:34] [INFO ] Invariant cache hit.
[2023-03-12 00:39:35] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2023-03-12 00:39:35] [INFO ] Invariant cache hit.
[2023-03-12 00:39:36] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1549 places, 2065/2119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3345 ms. Remains : 1512/1549 places, 2065/2119 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (NEQ s1445 0) (NEQ s1426 1)), p1:(AND (EQ s1145 0) (EQ s704 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 FlexibleBarrier-PT-22b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-07 finished in 3507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 5 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 2119/2119 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1530 transition count 2100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1530 transition count 2100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 1530 transition count 2096
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 1516 transition count 2082
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 1516 transition count 2082
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 80 place count 1516 transition count 2072
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 1514 transition count 2070
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 1514 transition count 2070
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 1514 transition count 2068
Applied a total of 86 rules in 222 ms. Remains 1514 /1549 variables (removed 35) and now considering 2068/2119 (removed 51) transitions.
// Phase 1: matrix 2068 rows 1514 cols
[2023-03-12 00:39:37] [INFO ] Computed 24 place invariants in 45 ms
[2023-03-12 00:39:37] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-12 00:39:37] [INFO ] Invariant cache hit.
[2023-03-12 00:39:39] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
[2023-03-12 00:39:39] [INFO ] Invariant cache hit.
[2023-03-12 00:39:40] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1514/1549 places, 2068/2119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3289 ms. Remains : 1514/1549 places, 2068/2119 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s865 1) (OR (EQ s641 0) (EQ s545 1))), p0:(OR (EQ s838 0) (EQ s927 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-09 finished in 3449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 4 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 2119/2119 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1528 transition count 2098
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1528 transition count 2098
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 1528 transition count 2095
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 62 place count 1511 transition count 2078
Iterating global reduction 1 with 17 rules applied. Total rules applied 79 place count 1511 transition count 2078
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 91 place count 1511 transition count 2066
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 1508 transition count 2063
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 1508 transition count 2063
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 100 place count 1508 transition count 2060
Applied a total of 100 rules in 226 ms. Remains 1508 /1549 variables (removed 41) and now considering 2060/2119 (removed 59) transitions.
// Phase 1: matrix 2060 rows 1508 cols
[2023-03-12 00:39:40] [INFO ] Computed 24 place invariants in 44 ms
[2023-03-12 00:39:41] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-12 00:39:41] [INFO ] Invariant cache hit.
[2023-03-12 00:39:42] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2023-03-12 00:39:42] [INFO ] Invariant cache hit.
[2023-03-12 00:39:43] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1549 places, 2060/2119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3417 ms. Remains : 1508/1549 places, 2060/2119 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s1344 0) (EQ s774 1)), p1:(AND (NEQ s360 0) (NEQ s1323 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 161 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-10 finished in 3605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1549/1549 places, 2119/2119 transitions.
Graph (trivial) has 1477 edges and 1549 vertex of which 133 / 1549 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 1437 transition count 1901
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 211 place count 1332 transition count 1901
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 211 place count 1332 transition count 1849
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 315 place count 1280 transition count 1849
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 379 place count 1216 transition count 1785
Iterating global reduction 2 with 64 rules applied. Total rules applied 443 place count 1216 transition count 1785
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 447 place count 1216 transition count 1781
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 460 place count 1203 transition count 1768
Iterating global reduction 3 with 13 rules applied. Total rules applied 473 place count 1203 transition count 1768
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 485 place count 1203 transition count 1756
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 753 place count 1069 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 756 place count 1066 transition count 1619
Iterating global reduction 4 with 3 rules applied. Total rules applied 759 place count 1066 transition count 1619
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 762 place count 1066 transition count 1616
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 784 place count 1066 transition count 1594
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 786 place count 1064 transition count 1592
Applied a total of 786 rules in 627 ms. Remains 1064 /1549 variables (removed 485) and now considering 1592/2119 (removed 527) transitions.
[2023-03-12 00:39:44] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
// Phase 1: matrix 1549 rows 1064 cols
[2023-03-12 00:39:44] [INFO ] Computed 24 place invariants in 51 ms
[2023-03-12 00:39:45] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-12 00:39:45] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:39:45] [INFO ] Invariant cache hit.
[2023-03-12 00:39:46] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2023-03-12 00:39:46] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 00:39:46] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:39:46] [INFO ] Invariant cache hit.
[2023-03-12 00:39:47] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1064/1549 places, 1592/2119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3170 ms. Remains : 1064/1549 places, 1592/2119 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s921 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3527 reset in 1411 ms.
Product exploration explored 100000 steps with 3520 reset in 1432 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 360 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 399108 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 399108 steps, saw 106032 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 00:39:53] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:39:53] [INFO ] Invariant cache hit.
[2023-03-12 00:39:53] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 00:39:53] [INFO ] [Nat]Absence check using 24 positive place invariants in 10 ms returned sat
[2023-03-12 00:39:54] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 00:39:54] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-12 00:39:54] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1064 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1042 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1042 transition count 1526
Free-agglomeration rule applied 927 times.
Iterating global reduction 1 with 927 rules applied. Total rules applied 1015 place count 1042 transition count 599
Reduce places removed 928 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 207 edges and 114 vertex of which 24 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Graph (trivial) has 56 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 1370 rules applied. Total rules applied 2385 place count 20 transition count 69
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2429 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2429 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2437 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2441 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2449 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2453 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 2464 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2465 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2466 place count 4 transition count 4
Applied a total of 2466 rules in 223 ms. Remains 4 /1064 variables (removed 1060) and now considering 4/1592 (removed 1588) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 4/1064 places, 4/1592 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Applied a total of 0 rules in 121 ms. Remains 1064 /1064 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2023-03-12 00:39:55] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:39:55] [INFO ] Invariant cache hit.
[2023-03-12 00:39:55] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-12 00:39:55] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:39:55] [INFO ] Invariant cache hit.
[2023-03-12 00:39:57] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2023-03-12 00:39:57] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 00:39:57] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:39:57] [INFO ] Invariant cache hit.
[2023-03-12 00:39:57] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2589 ms. Remains : 1064/1064 places, 1592/1592 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 355 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 398692 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398692 steps, saw 105857 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 00:40:01] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:40:01] [INFO ] Invariant cache hit.
[2023-03-12 00:40:01] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 00:40:01] [INFO ] [Nat]Absence check using 24 positive place invariants in 10 ms returned sat
[2023-03-12 00:40:02] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 00:40:02] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-12 00:40:02] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1064 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1042 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1042 transition count 1526
Free-agglomeration rule applied 927 times.
Iterating global reduction 1 with 927 rules applied. Total rules applied 1015 place count 1042 transition count 599
Reduce places removed 928 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 207 edges and 114 vertex of which 24 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Graph (trivial) has 56 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 1370 rules applied. Total rules applied 2385 place count 20 transition count 69
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2429 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2429 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2437 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2441 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2449 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2453 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 2464 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2465 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2466 place count 4 transition count 4
Applied a total of 2466 rules in 209 ms. Remains 4 /1064 variables (removed 1060) and now considering 4/1592 (removed 1588) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 4/1064 places, 4/1592 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3508 reset in 1405 ms.
Product exploration explored 100000 steps with 3519 reset in 1425 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Applied a total of 0 rules in 115 ms. Remains 1064 /1064 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2023-03-12 00:40:05] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:40:05] [INFO ] Invariant cache hit.
[2023-03-12 00:40:06] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-12 00:40:06] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:40:06] [INFO ] Invariant cache hit.
[2023-03-12 00:40:07] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2023-03-12 00:40:07] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 00:40:07] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:40:07] [INFO ] Invariant cache hit.
[2023-03-12 00:40:08] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2538 ms. Remains : 1064/1064 places, 1592/1592 transitions.
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-15 finished in 24536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 00:40:08] [INFO ] Flatten gal took : 69 ms
[2023-03-12 00:40:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 00:40:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1549 places, 2119 transitions and 6413 arcs took 13 ms.
Total runtime 76315 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/913/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/913/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FlexibleBarrier-PT-22b-LTLCardinality-00
Could not compute solution for formula : FlexibleBarrier-PT-22b-LTLCardinality-15

BK_STOP 1678581611131

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

+ 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name FlexibleBarrier-PT-22b-LTLCardinality-00
ltl formula formula --ltl=/tmp/913/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1549 places, 2119 transitions and 6413 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.090 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/913/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/913/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/913/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/913/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FlexibleBarrier-PT-22b-LTLCardinality-15
ltl formula formula --ltl=/tmp/913/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1549 places, 2119 transitions and 6413 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.080 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/913/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/913/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/913/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/913/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-22b, 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 r169-tall-167838856100595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b 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 ;