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.r393-oct2-167903717000443.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPs-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717000443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 02:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 172K Mar 5 18:23 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 ShieldPPPs-PT-010B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-010B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679448806261

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=ShieldPPPs-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:33:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 01:33:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:33:29] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-22 01:33:29] [INFO ] Transformed 683 places.
[2023-03-22 01:33:29] [INFO ] Transformed 633 transitions.
[2023-03-22 01:33:29] [INFO ] Found NUPN structural information;
[2023-03-22 01:33:29] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-010B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 633/633 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 621 transition count 571
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 621 transition count 571
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 620 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 620 transition count 570
Applied a total of 126 rules in 160 ms. Remains 620 /683 variables (removed 63) and now considering 570/633 (removed 63) transitions.
// Phase 1: matrix 570 rows 620 cols
[2023-03-22 01:33:29] [INFO ] Computed 111 place invariants in 17 ms
[2023-03-22 01:33:30] [INFO ] Implicit Places using invariants in 779 ms returned []
[2023-03-22 01:33:30] [INFO ] Invariant cache hit.
[2023-03-22 01:33:31] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
[2023-03-22 01:33:31] [INFO ] Invariant cache hit.
[2023-03-22 01:33:31] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 620/683 places, 570/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2229 ms. Remains : 620/683 places, 570/633 transitions.
Support contains 34 out of 620 places after structural reductions.
[2023-03-22 01:33:32] [INFO ] Flatten gal took : 63 ms
[2023-03-22 01:33:32] [INFO ] Flatten gal took : 29 ms
[2023-03-22 01:33:32] [INFO ] Input system was already deterministic with 570 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:33:32] [INFO ] Invariant cache hit.
[2023-03-22 01:33:32] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:33:32] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2023-03-22 01:33:33] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:33:33] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 4 ms to minimize.
[2023-03-22 01:33:33] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
[2023-03-22 01:33:33] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2023-03-22 01:33:34] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2023-03-22 01:33:34] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 1 ms to minimize.
[2023-03-22 01:33:34] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2023-03-22 01:33:34] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
[2023-03-22 01:33:34] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2023-03-22 01:33:35] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2023-03-22 01:33:35] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2023-03-22 01:33:35] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 1 ms to minimize.
[2023-03-22 01:33:35] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 1 ms to minimize.
[2023-03-22 01:33:35] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 0 ms to minimize.
[2023-03-22 01:33:36] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 0 ms to minimize.
[2023-03-22 01:33:36] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 0 ms to minimize.
[2023-03-22 01:33:36] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 1 ms to minimize.
[2023-03-22 01:33:36] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2023-03-22 01:33:37] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 1 ms to minimize.
[2023-03-22 01:33:37] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-22 01:33:37] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2023-03-22 01:33:37] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2023-03-22 01:33:37] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2023-03-22 01:33:37] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2023-03-22 01:33:38] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2023-03-22 01:33:38] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 1 ms to minimize.
[2023-03-22 01:33:38] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 0 ms to minimize.
[2023-03-22 01:33:38] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2023-03-22 01:33:38] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2023-03-22 01:33:38] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 2 ms to minimize.
[2023-03-22 01:33:39] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2023-03-22 01:33:39] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2023-03-22 01:33:39] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6048 ms
[2023-03-22 01:33:39] [INFO ] After 6473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 01:33:39] [INFO ] After 6635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 570/570 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 620 transition count 498
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 548 transition count 498
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 144 place count 548 transition count 449
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 242 place count 499 transition count 449
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 248 place count 493 transition count 443
Iterating global reduction 2 with 6 rules applied. Total rules applied 254 place count 493 transition count 443
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 254 place count 493 transition count 440
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 260 place count 490 transition count 440
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 608 place count 316 transition count 266
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 2 with 87 rules applied. Total rules applied 695 place count 316 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 315 transition count 265
Applied a total of 696 rules in 92 ms. Remains 315 /620 variables (removed 305) and now considering 265/570 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 315/620 places, 265/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617251 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617251 steps, saw 466656 distinct states, run finished after 3015 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 315 cols
[2023-03-22 01:33:42] [INFO ] Computed 111 place invariants in 6 ms
[2023-03-22 01:33:42] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:33:42] [INFO ] [Nat]Absence check using 106 positive place invariants in 68 ms returned sat
[2023-03-22 01:33:42] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 01:33:42] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:33:43] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-22 01:33:43] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-22 01:33:43] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 18 ms to minimize.
[2023-03-22 01:33:43] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-22 01:33:43] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2023-03-22 01:33:43] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:33:43] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-22 01:33:44] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 14 ms to minimize.
[2023-03-22 01:33:44] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-22 01:33:44] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-22 01:33:44] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-03-22 01:33:44] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-22 01:33:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1646 ms
[2023-03-22 01:33:44] [INFO ] After 1828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 01:33:44] [INFO ] After 1992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 265/265 transitions.
Applied a total of 0 rules in 10 ms. Remains 315 /315 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 315/315 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 265/265 transitions.
Applied a total of 0 rules in 10 ms. Remains 315 /315 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2023-03-22 01:33:44] [INFO ] Invariant cache hit.
[2023-03-22 01:33:44] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-22 01:33:44] [INFO ] Invariant cache hit.
[2023-03-22 01:33:45] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-22 01:33:45] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 01:33:45] [INFO ] Invariant cache hit.
[2023-03-22 01:33:45] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 926 ms. Remains : 315/315 places, 265/265 transitions.
Applied a total of 0 rules in 8 ms. Remains 315 /315 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 01:33:45] [INFO ] Invariant cache hit.
[2023-03-22 01:33:45] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:33:45] [INFO ] [Nat]Absence check using 106 positive place invariants in 83 ms returned sat
[2023-03-22 01:33:45] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 01:33:45] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:33:46] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-22 01:33:46] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 0 ms to minimize.
[2023-03-22 01:33:46] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-22 01:33:46] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-22 01:33:46] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-22 01:33:46] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2023-03-22 01:33:47] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-22 01:33:47] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-22 01:33:47] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-22 01:33:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1395 ms
[2023-03-22 01:33:47] [INFO ] After 1608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 01:33:47] [INFO ] After 1791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldPPPs-PT-010B-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 125 stabilizing places and 125 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 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 619 transition count 498
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 548 transition count 498
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 142 place count 548 transition count 449
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 240 place count 499 transition count 449
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 491 transition count 441
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 256 place count 491 transition count 437
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 264 place count 487 transition count 437
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 1 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 610 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 612 place count 312 transition count 262
Applied a total of 612 rules in 112 ms. Remains 312 /620 variables (removed 308) and now considering 262/570 (removed 308) transitions.
// Phase 1: matrix 262 rows 312 cols
[2023-03-22 01:33:48] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:33:48] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-22 01:33:48] [INFO ] Invariant cache hit.
[2023-03-22 01:33:48] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-22 01:33:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 01:33:48] [INFO ] Invariant cache hit.
[2023-03-22 01:33:49] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/620 places, 262/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1120 ms. Remains : 312/620 places, 262/570 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-01 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 s177 0) (EQ s307 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 136 reset in 515 ms.
Product exploration explored 100000 steps with 135 reset in 461 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 168 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 49 ms :[(NOT p0)]
Finished random walk after 332 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=83 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 207 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 104 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-22 01:33:50] [INFO ] Invariant cache hit.
[2023-03-22 01:33:51] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-22 01:33:51] [INFO ] Invariant cache hit.
[2023-03-22 01:33:51] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2023-03-22 01:33:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 01:33:51] [INFO ] Invariant cache hit.
[2023-03-22 01:33:52] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1077 ms. Remains : 312/312 places, 262/262 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 139 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 68 ms :[(NOT p0)]
Finished random walk after 242 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 247 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 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Product exploration explored 100000 steps with 138 reset in 467 ms.
Product exploration explored 100000 steps with 136 reset in 411 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-22 01:33:53] [INFO ] Invariant cache hit.
[2023-03-22 01:33:53] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-22 01:33:53] [INFO ] Invariant cache hit.
[2023-03-22 01:33:54] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-22 01:33:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:33:54] [INFO ] Invariant cache hit.
[2023-03-22 01:33:54] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 757 ms. Remains : 312/312 places, 262/262 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-01 finished in 6638 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(X(p0)) U p1)))'
Support contains 3 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 612 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 612 transition count 562
Applied a total of 16 rules in 34 ms. Remains 612 /620 variables (removed 8) and now considering 562/570 (removed 8) transitions.
// Phase 1: matrix 562 rows 612 cols
[2023-03-22 01:33:54] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:33:54] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-22 01:33:54] [INFO ] Invariant cache hit.
[2023-03-22 01:33:55] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2023-03-22 01:33:55] [INFO ] Invariant cache hit.
[2023-03-22 01:33:55] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/620 places, 562/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1337 ms. Remains : 612/620 places, 562/570 transitions.
Stuttering acceptance computed with spot in 332 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s219 1), p1:(OR (EQ s126 0) (EQ s221 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 549 ms.
Product exploration explored 100000 steps with 50000 reset in 418 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-02 finished in 2891 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(G(p0))||(p1 U X(p2))))'
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 564
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 564
Applied a total of 12 rules in 48 ms. Remains 614 /620 variables (removed 6) and now considering 564/570 (removed 6) transitions.
// Phase 1: matrix 564 rows 614 cols
[2023-03-22 01:33:57] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:33:57] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-22 01:33:57] [INFO ] Invariant cache hit.
[2023-03-22 01:33:58] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2023-03-22 01:33:58] [INFO ] Invariant cache hit.
[2023-03-22 01:33:58] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/620 places, 564/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1297 ms. Remains : 614/620 places, 564/570 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}]], initial=1, aps=[p1:(OR (EQ s378 0) (EQ s117 1)), p0:(EQ s384 1), p2:(EQ s605 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 212 steps with 1 reset in 4 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-03 finished in 1610 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(X(G(p0))))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 613 transition count 563
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 613 transition count 563
Applied a total of 14 rules in 28 ms. Remains 613 /620 variables (removed 7) and now considering 563/570 (removed 7) transitions.
// Phase 1: matrix 563 rows 613 cols
[2023-03-22 01:33:59] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-22 01:33:59] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-22 01:33:59] [INFO ] Invariant cache hit.
[2023-03-22 01:33:59] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-03-22 01:33:59] [INFO ] Invariant cache hit.
[2023-03-22 01:34:00] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/620 places, 563/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1076 ms. Remains : 613/620 places, 563/570 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s555 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-05 finished in 1240 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(X(X(G(p0)))))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 612 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 612 transition count 562
Applied a total of 16 rules in 46 ms. Remains 612 /620 variables (removed 8) and now considering 562/570 (removed 8) transitions.
// Phase 1: matrix 562 rows 612 cols
[2023-03-22 01:34:00] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-22 01:34:00] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-22 01:34:00] [INFO ] Invariant cache hit.
[2023-03-22 01:34:01] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2023-03-22 01:34:01] [INFO ] Invariant cache hit.
[2023-03-22 01:34:01] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/620 places, 562/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1376 ms. Remains : 612/620 places, 562/570 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s440 0) (EQ s343 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-06 finished in 1619 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((G(F(p0))||(F(p0)&&p1))))'
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 613 transition count 563
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 613 transition count 563
Applied a total of 14 rules in 60 ms. Remains 613 /620 variables (removed 7) and now considering 563/570 (removed 7) transitions.
// Phase 1: matrix 563 rows 613 cols
[2023-03-22 01:34:01] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:34:02] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-22 01:34:02] [INFO ] Invariant cache hit.
[2023-03-22 01:34:02] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-22 01:34:02] [INFO ] Invariant cache hit.
[2023-03-22 01:34:03] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/620 places, 563/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1296 ms. Remains : 613/620 places, 563/570 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s510 1)), p1:(AND (EQ s594 0) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 392 reset in 309 ms.
Product exploration explored 100000 steps with 399 reset in 278 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 376 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 248 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 381 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 154 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
[2023-03-22 01:34:05] [INFO ] Invariant cache hit.
[2023-03-22 01:34:05] [INFO ] [Real]Absence check using 111 positive place invariants in 140 ms returned sat
[2023-03-22 01:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:34:06] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2023-03-22 01:34:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:34:06] [INFO ] [Nat]Absence check using 111 positive place invariants in 44 ms returned sat
[2023-03-22 01:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:34:08] [INFO ] [Nat]Absence check using state equation in 1615 ms returned sat
[2023-03-22 01:34:08] [INFO ] Computed and/alt/rep : 562/993/562 causal constraints (skipped 0 transitions) in 106 ms.
[2023-03-22 01:34:21] [INFO ] Added : 557 causal constraints over 116 iterations in 12506 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 613 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 490
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 490
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 540 transition count 440
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 490 transition count 440
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 594 place count 315 transition count 265
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 313 transition count 263
Applied a total of 596 rules in 38 ms. Remains 313 /613 variables (removed 300) and now considering 263/563 (removed 300) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:34:21] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:34:21] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-22 01:34:21] [INFO ] Invariant cache hit.
[2023-03-22 01:34:21] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2023-03-22 01:34:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:34:21] [INFO ] Invariant cache hit.
[2023-03-22 01:34:22] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 313/613 places, 263/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 915 ms. Remains : 313/613 places, 263/563 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 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 129 ms :[(NOT p0), (NOT p0)]
Finished random walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 260 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 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
[2023-03-22 01:34:22] [INFO ] Invariant cache hit.
[2023-03-22 01:34:26] [INFO ] [Real]Absence check using 111 positive place invariants in 56 ms returned sat
[2023-03-22 01:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:34:26] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2023-03-22 01:34:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:34:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 595 ms returned sat
[2023-03-22 01:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:34:29] [INFO ] [Nat]Absence check using state equation in 2241 ms returned sat
[2023-03-22 01:34:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-22 01:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-22 01:34:30] [INFO ] Computed and/alt/rep : 261/496/261 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-22 01:34:31] [INFO ] Added : 215 causal constraints over 43 iterations in 1815 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2102 reset in 295 ms.
Product exploration explored 100000 steps with 2108 reset in 310 ms.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 262
Applied a total of 2 rules in 9 ms. Remains 312 /313 variables (removed 1) and now considering 262/263 (removed 1) transitions.
// Phase 1: matrix 262 rows 312 cols
[2023-03-22 01:34:32] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:34:32] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-22 01:34:32] [INFO ] Invariant cache hit.
[2023-03-22 01:34:33] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-22 01:34:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:34:33] [INFO ] Invariant cache hit.
[2023-03-22 01:34:33] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 262/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 987 ms. Remains : 312/313 places, 262/263 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-07 finished in 31765 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(p1)))))'
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 564
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 564
Applied a total of 12 rules in 23 ms. Remains 614 /620 variables (removed 6) and now considering 564/570 (removed 6) transitions.
// Phase 1: matrix 564 rows 614 cols
[2023-03-22 01:34:33] [INFO ] Computed 111 place invariants in 10 ms
[2023-03-22 01:34:33] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-22 01:34:33] [INFO ] Invariant cache hit.
[2023-03-22 01:34:35] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2023-03-22 01:34:35] [INFO ] Invariant cache hit.
[2023-03-22 01:34:35] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/620 places, 564/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2402 ms. Remains : 614/620 places, 564/570 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s258 0) (EQ s356 1) (EQ s177 0) (EQ s601 1)), p1:(AND (EQ s356 0) (EQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1656 steps with 0 reset in 17 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-08 finished in 2637 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(X(F(p0))))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 612 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 612 transition count 562
Applied a total of 16 rules in 38 ms. Remains 612 /620 variables (removed 8) and now considering 562/570 (removed 8) transitions.
// Phase 1: matrix 562 rows 612 cols
[2023-03-22 01:34:36] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:34:36] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-22 01:34:36] [INFO ] Invariant cache hit.
[2023-03-22 01:34:37] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-22 01:34:37] [INFO ] Invariant cache hit.
[2023-03-22 01:34:37] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/620 places, 562/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1485 ms. Remains : 612/620 places, 562/570 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s444 0) (EQ s532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 356 ms.
Product exploration explored 100000 steps with 33333 reset in 339 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-09 finished in 2493 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(G(p0)))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 613 transition count 563
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 613 transition count 563
Applied a total of 14 rules in 41 ms. Remains 613 /620 variables (removed 7) and now considering 563/570 (removed 7) transitions.
// Phase 1: matrix 563 rows 613 cols
[2023-03-22 01:34:38] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-22 01:34:38] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-22 01:34:39] [INFO ] Invariant cache hit.
[2023-03-22 01:34:39] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-22 01:34:39] [INFO ] Invariant cache hit.
[2023-03-22 01:34:39] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/620 places, 563/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 613/620 places, 563/570 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s45 0) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-11 finished in 1422 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)))'
Support contains 1 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 619 transition count 497
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 547 transition count 497
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 547 transition count 447
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 497 transition count 447
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 252 place count 489 transition count 439
Iterating global reduction 2 with 8 rules applied. Total rules applied 260 place count 489 transition count 439
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 260 place count 489 transition count 435
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 268 place count 485 transition count 435
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 612 place count 313 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 614 place count 311 transition count 261
Applied a total of 614 rules in 126 ms. Remains 311 /620 variables (removed 309) and now considering 261/570 (removed 309) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-22 01:34:40] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:34:40] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-22 01:34:40] [INFO ] Invariant cache hit.
[2023-03-22 01:34:40] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-03-22 01:34:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:34:40] [INFO ] Invariant cache hit.
[2023-03-22 01:34:41] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/620 places, 261/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1016 ms. Remains : 311/620 places, 261/570 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s108 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 141 reset in 390 ms.
Product exploration explored 100000 steps with 142 reset in 412 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 165 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 41 ms :[(NOT p0)]
Finished random walk after 127 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=127 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:34:42] [INFO ] Invariant cache hit.
[2023-03-22 01:34:42] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-22 01:34:42] [INFO ] Invariant cache hit.
[2023-03-22 01:34:43] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2023-03-22 01:34:43] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 01:34:43] [INFO ] Invariant cache hit.
[2023-03-22 01:34:44] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1520 ms. Remains : 311/311 places, 261/261 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 229 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 50 ms :[(NOT p0)]
Finished random walk after 137 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 310 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 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 140 reset in 448 ms.
Product exploration explored 100000 steps with 140 reset in 471 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:34:45] [INFO ] Invariant cache hit.
[2023-03-22 01:34:46] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-22 01:34:46] [INFO ] Invariant cache hit.
[2023-03-22 01:34:46] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2023-03-22 01:34:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:34:46] [INFO ] Invariant cache hit.
[2023-03-22 01:34:46] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1001 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-12 finished in 6675 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)||G(p1)||G(p2))))'
Support contains 5 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 619 transition count 501
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 551 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 550 transition count 500
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 138 place count 550 transition count 449
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 240 place count 499 transition count 449
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 248 place count 491 transition count 441
Iterating global reduction 3 with 8 rules applied. Total rules applied 256 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 256 place count 491 transition count 437
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 264 place count 487 transition count 437
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 602 place count 318 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 317 transition count 267
Applied a total of 603 rules in 42 ms. Remains 317 /620 variables (removed 303) and now considering 267/570 (removed 303) transitions.
// Phase 1: matrix 267 rows 317 cols
[2023-03-22 01:34:46] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-22 01:34:47] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-22 01:34:47] [INFO ] Invariant cache hit.
[2023-03-22 01:34:47] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-22 01:34:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 01:34:47] [INFO ] Invariant cache hit.
[2023-03-22 01:34:49] [INFO ] Dead Transitions using invariants and state equation in 1912 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 317/620 places, 267/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2382 ms. Remains : 317/620 places, 267/570 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s222 0) (EQ s139 1)), p1:(EQ s1 1), p2:(OR (EQ s306 0) (EQ s257 1))], nbAcceptance=3, 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 137 reset in 525 ms.
Product exploration explored 100000 steps with 136 reset in 495 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/317 stabilizing places and 4/267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 1031 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 01:34:51] [INFO ] Invariant cache hit.
[2023-03-22 01:34:52] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:34:52] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2023-03-22 01:34:52] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 1471 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2))]
Support contains 4 out of 317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 267/267 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2023-03-22 01:34:53] [INFO ] Invariant cache hit.
[2023-03-22 01:34:54] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-22 01:34:54] [INFO ] Invariant cache hit.
[2023-03-22 01:34:54] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-22 01:34:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:34:54] [INFO ] Invariant cache hit.
[2023-03-22 01:34:54] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 846 ms. Remains : 317/317 places, 267/267 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 616 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 116 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 583 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 137 reset in 491 ms.
Product exploration explored 100000 steps with 137 reset in 441 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 265
Applied a total of 1 rules in 22 ms. Remains 315 /317 variables (removed 2) and now considering 265/267 (removed 2) transitions.
// Phase 1: matrix 265 rows 315 cols
[2023-03-22 01:34:57] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:34:57] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-22 01:34:57] [INFO ] Invariant cache hit.
[2023-03-22 01:34:57] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2023-03-22 01:34:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:34:57] [INFO ] Invariant cache hit.
[2023-03-22 01:34:57] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/317 places, 265/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 840 ms. Remains : 315/317 places, 265/267 transitions.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-13 finished in 11204 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' '!(X((G(F(p0))||(F(p0)&&p1))))'
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' '!(F((G(p0)||G(p1)||G(p2))))'
[2023-03-22 01:34:58] [INFO ] Flatten gal took : 53 ms
[2023-03-22 01:34:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 01:34:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 620 places, 570 transitions and 1620 arcs took 17 ms.
Total runtime 89387 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1651/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1651/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1651/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1651/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-010B-LTLCardinality-01
Could not compute solution for formula : ShieldPPPs-PT-010B-LTLCardinality-07
Could not compute solution for formula : ShieldPPPs-PT-010B-LTLCardinality-12
Could not compute solution for formula : ShieldPPPs-PT-010B-LTLCardinality-13

BK_STOP 1679448899792

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.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 ShieldPPPs-PT-010B-LTLCardinality-01
ltl formula formula --ltl=/tmp/1651/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 620 places, 570 transitions and 1620 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.110 real 0.040 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1651/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1651/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1651/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1651/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 ShieldPPPs-PT-010B-LTLCardinality-07
ltl formula formula --ltl=/tmp/1651/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 620 places, 570 transitions and 1620 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.100 real 0.020 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1651/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1651/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1651/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1651/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 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)
ltl formula name ShieldPPPs-PT-010B-LTLCardinality-12
ltl formula formula --ltl=/tmp/1651/ltl_2_
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 620 places, 570 transitions and 1620 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.100 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1651/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1651/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1651/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1651/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55e8ad2a93f4]
1: pnml2lts-mc(+0xa2496) [0x55e8ad2a9496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5b9940d140]
3: pnml2lts-mc(+0x405be5) [0x55e8ad60cbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55e8ad3723f9]
5: pnml2lts-mc(+0x164ac4) [0x55e8ad36bac4]
6: pnml2lts-mc(+0x272e0a) [0x55e8ad479e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e8ad2bd1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f5b992604d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f5b9926067a]
10: pnml2lts-mc(+0xa1581) [0x55e8ad2a8581]
11: pnml2lts-mc(+0xa1910) [0x55e8ad2a8910]
12: pnml2lts-mc(+0xa32a2) [0x55e8ad2aa2a2]
13: pnml2lts-mc(+0xa50f4) [0x55e8ad2ac0f4]
14: pnml2lts-mc(+0xa516b) [0x55e8ad2ac16b]
15: pnml2lts-mc(+0x3f34b3) [0x55e8ad5fa4b3]
16: pnml2lts-mc(+0x7c63d) [0x55e8ad28363d]
17: pnml2lts-mc(+0x67d86) [0x55e8ad26ed86]
18: pnml2lts-mc(+0x60a8a) [0x55e8ad267a8a]
19: pnml2lts-mc(+0x5eb15) [0x55e8ad265b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f5b99248d0a]
21: pnml2lts-mc(+0x6075e) [0x55e8ad26775e]
ltl formula name ShieldPPPs-PT-010B-LTLCardinality-13
ltl formula formula --ltl=/tmp/1651/ltl_3_
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 620 places, 570 transitions and 1620 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.090 real 0.010 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1651/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1651/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1651/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1651/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="ShieldPPPs-PT-010B"
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 ShieldPPPs-PT-010B, 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 r393-oct2-167903717000443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010B.tgz
mv ShieldPPPs-PT-010B 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 ;