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.r389-oct2-167903713800619.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 itstools
Input is ShieldPPPt-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 185K 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 ShieldPPPt-PT-010B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679215982929

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 08:53:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 08:53:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 08:53:05] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-19 08:53:05] [INFO ] Transformed 783 places.
[2023-03-19 08:53:05] [INFO ] Transformed 713 transitions.
[2023-03-19 08:53:05] [INFO ] Found NUPN structural information;
[2023-03-19 08:53:05] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 108 place count 675 transition count 605
Iterating global reduction 0 with 108 rules applied. Total rules applied 216 place count 675 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 217 place count 674 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 673 transition count 603
Applied a total of 220 rules in 337 ms. Remains 673 /783 variables (removed 110) and now considering 603/713 (removed 110) transitions.
// Phase 1: matrix 603 rows 673 cols
[2023-03-19 08:53:06] [INFO ] Computed 111 place invariants in 14 ms
[2023-03-19 08:53:06] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-19 08:53:06] [INFO ] Invariant cache hit.
[2023-03-19 08:53:07] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
[2023-03-19 08:53:07] [INFO ] Invariant cache hit.
[2023-03-19 08:53:08] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 673/783 places, 603/713 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2302 ms. Remains : 673/783 places, 603/713 transitions.
Support contains 21 out of 673 places after structural reductions.
[2023-03-19 08:53:08] [INFO ] Flatten gal took : 148 ms
[2023-03-19 08:53:08] [INFO ] Flatten gal took : 41 ms
[2023-03-19 08:53:08] [INFO ] Input system was already deterministic with 603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 16) seen :15
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-19 08:53:09] [INFO ] Invariant cache hit.
[2023-03-19 08:53:09] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:53:09] [INFO ] [Nat]Absence check using 111 positive place invariants in 42 ms returned sat
[2023-03-19 08:53:10] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:53:10] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 33 ms to minimize.
[2023-03-19 08:53:11] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 1 ms to minimize.
[2023-03-19 08:53:11] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 14 ms to minimize.
[2023-03-19 08:53:11] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 15 ms to minimize.
[2023-03-19 08:53:11] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 2 ms to minimize.
[2023-03-19 08:53:11] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2023-03-19 08:53:12] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2023-03-19 08:53:12] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2023-03-19 08:53:12] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 13 ms to minimize.
[2023-03-19 08:53:12] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2023-03-19 08:53:12] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2023-03-19 08:53:12] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 1 ms to minimize.
[2023-03-19 08:53:13] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2023-03-19 08:53:13] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-03-19 08:53:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3082 ms
[2023-03-19 08:53:13] [INFO ] After 3521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-19 08:53:13] [INFO ] After 3854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 673/673 places, 603/603 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 673 transition count 465
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 535 transition count 465
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 276 place count 535 transition count 386
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 434 place count 456 transition count 386
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 436 place count 454 transition count 384
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 454 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 438 place count 454 transition count 382
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 442 place count 452 transition count 382
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 780 place count 283 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 781 place count 283 transition count 212
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 3 with 2 rules applied. Total rules applied 783 place count 282 transition count 211
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 839 place count 254 transition count 211
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 867 place count 254 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 868 place count 253 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 869 place count 252 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 869 place count 252 transition count 208
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 873 place count 250 transition count 208
Applied a total of 873 rules in 107 ms. Remains 250 /673 variables (removed 423) and now considering 208/603 (removed 395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 250/673 places, 208/603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 730060 steps, run timeout after 3013 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 730060 steps, saw 501119 distinct states, run finished after 3016 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 208 rows 250 cols
[2023-03-19 08:53:16] [INFO ] Computed 110 place invariants in 4 ms
[2023-03-19 08:53:16] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:53:16] [INFO ] [Nat]Absence check using 110 positive place invariants in 18 ms returned sat
[2023-03-19 08:53:16] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:53:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 08:53:16] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 08:53:16] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 08:53:16] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 208/208 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 250/250 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 208/208 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-19 08:53:16] [INFO ] Invariant cache hit.
[2023-03-19 08:53:17] [INFO ] Implicit Places using invariants in 413 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 416 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 248/250 places, 208/208 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 246 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 206
Applied a total of 4 rules in 14 ms. Remains 246 /248 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 246 cols
[2023-03-19 08:53:17] [INFO ] Computed 108 place invariants in 1 ms
[2023-03-19 08:53:17] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-19 08:53:17] [INFO ] Invariant cache hit.
[2023-03-19 08:53:17] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 246/250 places, 206/208 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 978 ms. Remains : 246/250 places, 206/208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 790033 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 790033 steps, saw 552441 distinct states, run finished after 3002 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 08:53:21] [INFO ] Invariant cache hit.
[2023-03-19 08:53:21] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:53:21] [INFO ] [Nat]Absence check using 108 positive place invariants in 35 ms returned sat
[2023-03-19 08:53:21] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:53:21] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2023-03-19 08:53:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-19 08:53:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-19 08:53:21] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 08:53:21] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 125 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=125 )
Parikh walk visited 1 properties in 1 ms.
Computed a total of 158 stabilizing places and 158 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' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 57 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
// Phase 1: matrix 601 rows 671 cols
[2023-03-19 08:53:21] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-19 08:53:22] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-19 08:53:22] [INFO ] Invariant cache hit.
[2023-03-19 08:53:22] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-19 08:53:22] [INFO ] Invariant cache hit.
[2023-03-19 08:53:23] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1649 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s343 1), p1:(AND (EQ s668 0) (EQ s173 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 4233 reset in 347 ms.
Product exploration explored 100000 steps with 4258 reset in 252 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Detected a total of 158/671 stabilizing places and 158/601 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 381 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 341 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-19 08:53:25] [INFO ] Invariant cache hit.
[2023-03-19 08:53:26] [INFO ] [Real]Absence check using 111 positive place invariants in 42 ms returned sat
[2023-03-19 08:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:53:27] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2023-03-19 08:53:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:53:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 252 ms returned sat
[2023-03-19 08:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:53:29] [INFO ] [Nat]Absence check using state equation in 1865 ms returned sat
[2023-03-19 08:53:29] [INFO ] Computed and/alt/rep : 600/891/600 causal constraints (skipped 0 transitions) in 93 ms.
[2023-03-19 08:53:39] [INFO ] Added : 600 causal constraints over 121 iterations in 9661 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 671 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 601/601 transitions.
Applied a total of 0 rules in 19 ms. Remains 671 /671 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2023-03-19 08:53:39] [INFO ] Invariant cache hit.
[2023-03-19 08:53:40] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-19 08:53:40] [INFO ] Invariant cache hit.
[2023-03-19 08:53:41] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
[2023-03-19 08:53:41] [INFO ] Invariant cache hit.
[2023-03-19 08:53:41] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2293 ms. Remains : 671/671 places, 601/601 transitions.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Detected a total of 158/671 stabilizing places and 158/601 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-19 08:53:42] [INFO ] Invariant cache hit.
[2023-03-19 08:53:43] [INFO ] [Real]Absence check using 111 positive place invariants in 87 ms returned sat
[2023-03-19 08:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:53:44] [INFO ] [Real]Absence check using state equation in 1791 ms returned sat
[2023-03-19 08:53:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:53:45] [INFO ] [Nat]Absence check using 111 positive place invariants in 177 ms returned sat
[2023-03-19 08:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:53:47] [INFO ] [Nat]Absence check using state equation in 1704 ms returned sat
[2023-03-19 08:53:47] [INFO ] Computed and/alt/rep : 600/891/600 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-19 08:53:55] [INFO ] Added : 600 causal constraints over 121 iterations in 8778 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4198 reset in 261 ms.
Product exploration explored 100000 steps with 4233 reset in 293 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 671 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 671/671 places, 601/601 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 671 transition count 601
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 139 place count 671 transition count 641
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 190 place count 671 transition count 641
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 376 places in 0 ms
Iterating global reduction 1 with 186 rules applied. Total rules applied 376 place count 671 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 377 place count 671 transition count 640
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 447 place count 601 transition count 570
Deduced a syphon composed of 306 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 517 place count 601 transition count 570
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 307 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 518 place count 601 transition count 570
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 520 place count 599 transition count 568
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 522 place count 599 transition count 568
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -160
Deduced a syphon composed of 343 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 560 place count 599 transition count 728
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 598 place count 561 transition count 652
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 636 place count 561 transition count 652
Deduced a syphon composed of 305 places in 0 ms
Applied a total of 636 rules in 378 ms. Remains 561 /671 variables (removed 110) and now considering 652/601 (removed -51) transitions.
[2023-03-19 08:53:57] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 652 rows 561 cols
[2023-03-19 08:53:57] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-19 08:53:57] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/671 places, 652/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 728 ms. Remains : 561/671 places, 652/601 transitions.
Built C files in :
/tmp/ltsmin2641711708687206475
[2023-03-19 08:53:57] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2641711708687206475
Running compilation step : cd /tmp/ltsmin2641711708687206475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1041 ms.
Running link step : cd /tmp/ltsmin2641711708687206475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 103 ms.
Running LTSmin : cd /tmp/ltsmin2641711708687206475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7296583932935927043.hoa' '--buchi-type=spotba'
LTSmin run took 1610 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-02 finished in 38963 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 2 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 672 transition count 464
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 534 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 533 transition count 463
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 278 place count 533 transition count 385
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 434 place count 455 transition count 385
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 436 place count 453 transition count 383
Iterating global reduction 3 with 2 rules applied. Total rules applied 438 place count 453 transition count 383
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 438 place count 453 transition count 381
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 442 place count 451 transition count 381
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 776 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 284 transition count 213
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 4 with 2 rules applied. Total rules applied 779 place count 283 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 837 place count 254 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 839 place count 252 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 840 place count 251 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 840 place count 251 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 844 place count 249 transition count 208
Applied a total of 844 rules in 80 ms. Remains 249 /673 variables (removed 424) and now considering 208/603 (removed 395) transitions.
// Phase 1: matrix 208 rows 249 cols
[2023-03-19 08:54:00] [INFO ] Computed 110 place invariants in 0 ms
[2023-03-19 08:54:00] [INFO ] Implicit Places using invariants in 137 ms returned [232, 236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 138 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/673 places, 208/603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 206
Applied a total of 4 rules in 6 ms. Remains 245 /247 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 245 cols
[2023-03-19 08:54:00] [INFO ] Computed 108 place invariants in 1 ms
[2023-03-19 08:54:01] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-19 08:54:01] [INFO ] Invariant cache hit.
[2023-03-19 08:54:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 08:54:01] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/673 places, 206/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 854 ms. Remains : 245/673 places, 206/603 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-04 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 s63 0) (EQ s122 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 0 reset in 301 ms.
Stack based approach found an accepted trace after 1017 steps with 0 reset with depth 1018 and stack size 990 in 5 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-04 finished in 1203 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((F((p1||G(p2)))&&p0))))'
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 27 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
// Phase 1: matrix 601 rows 671 cols
[2023-03-19 08:54:01] [INFO ] Computed 111 place invariants in 6 ms
[2023-03-19 08:54:02] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-19 08:54:02] [INFO ] Invariant cache hit.
[2023-03-19 08:54:02] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
[2023-03-19 08:54:02] [INFO ] Invariant cache hit.
[2023-03-19 08:54:03] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1504 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s426 0) (EQ s171 1)), p1:(AND (EQ s426 0) (EQ s171 1)), p2:(OR (EQ s494 0) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 35 reset in 320 ms.
Stack based approach found an accepted trace after 424 steps with 0 reset with depth 425 and stack size 425 in 2 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-06 finished in 2086 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 1 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 70 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
[2023-03-19 08:54:04] [INFO ] Invariant cache hit.
[2023-03-19 08:54:04] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-19 08:54:04] [INFO ] Invariant cache hit.
[2023-03-19 08:54:04] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-19 08:54:04] [INFO ] Invariant cache hit.
[2023-03-19 08:54:05] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1381 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-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:(EQ s596 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 420 reset in 282 ms.
Stack based approach found an accepted trace after 487 steps with 1 reset with depth 246 and stack size 246 in 2 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-09 finished in 1865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (G(p1) U G(p2))))'
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 672 transition count 464
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 534 transition count 464
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 276 place count 534 transition count 385
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 434 place count 455 transition count 385
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 436 place count 453 transition count 383
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 453 transition count 383
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 438 place count 453 transition count 381
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 442 place count 451 transition count 381
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 330 rules applied. Total rules applied 772 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 773 place count 286 transition count 215
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 3 with 2 rules applied. Total rules applied 775 place count 285 transition count 214
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 831 place count 257 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 833 place count 255 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 834 place count 254 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 834 place count 254 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 838 place count 252 transition count 210
Applied a total of 838 rules in 50 ms. Remains 252 /673 variables (removed 421) and now considering 210/603 (removed 393) transitions.
// Phase 1: matrix 210 rows 252 cols
[2023-03-19 08:54:05] [INFO ] Computed 110 place invariants in 1 ms
[2023-03-19 08:54:06] [INFO ] Implicit Places using invariants in 253 ms returned [235, 239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 267 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/673 places, 210/603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 248 transition count 208
Applied a total of 4 rules in 6 ms. Remains 248 /250 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 248 cols
[2023-03-19 08:54:06] [INFO ] Computed 108 place invariants in 0 ms
[2023-03-19 08:54:06] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-19 08:54:06] [INFO ] Invariant cache hit.
[2023-03-19 08:54:06] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 248/673 places, 208/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1043 ms. Remains : 248/673 places, 208/603 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s131 1) (OR (EQ s22 0) (EQ s57 1))), p1:(OR (EQ s22 0) (EQ s57 1)), p0:(NEQ s131 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1356 reset in 382 ms.
Stack based approach found an accepted trace after 3090 steps with 30 reset with depth 3 and stack size 3 in 12 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-11 finished in 1836 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(((p1||(!p2 U (p3||G(!p2))))&&p0))))'
Support contains 5 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Applied a total of 0 rules in 12 ms. Remains 673 /673 variables (removed 0) and now considering 603/603 (removed 0) transitions.
// Phase 1: matrix 603 rows 673 cols
[2023-03-19 08:54:07] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-19 08:54:08] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-19 08:54:08] [INFO ] Invariant cache hit.
[2023-03-19 08:54:08] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-19 08:54:08] [INFO ] Invariant cache hit.
[2023-03-19 08:54:08] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1237 ms. Remains : 673/673 places, 603/603 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, (AND (NOT p3) p2), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p3:(AND (NEQ s636 1) (NOT (OR (EQ s395 0) (EQ s26 1)))), p2:(OR (EQ s395 0) (EQ s26 1)), p0:(AND (EQ s26 0) (EQ s395 1)), p1:(AND (EQ s462 0) (EQ s143 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-12 finished in 1585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 672 transition count 464
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 534 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 533 transition count 463
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 278 place count 533 transition count 386
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 432 place count 456 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 434 place count 454 transition count 384
Iterating global reduction 3 with 2 rules applied. Total rules applied 436 place count 454 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 436 place count 454 transition count 382
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 440 place count 452 transition count 382
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 770 place count 287 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 771 place count 287 transition count 216
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 4 with 2 rules applied. Total rules applied 773 place count 286 transition count 215
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 829 place count 258 transition count 215
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 831 place count 256 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 832 place count 255 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 832 place count 255 transition count 211
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 836 place count 253 transition count 211
Applied a total of 836 rules in 78 ms. Remains 253 /673 variables (removed 420) and now considering 211/603 (removed 392) transitions.
// Phase 1: matrix 211 rows 253 cols
[2023-03-19 08:54:09] [INFO ] Computed 110 place invariants in 1 ms
[2023-03-19 08:54:09] [INFO ] Implicit Places using invariants in 147 ms returned [236, 240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 155 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/673 places, 211/603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 249 transition count 209
Applied a total of 4 rules in 6 ms. Remains 249 /251 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 249 cols
[2023-03-19 08:54:09] [INFO ] Computed 108 place invariants in 0 ms
[2023-03-19 08:54:09] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-19 08:54:09] [INFO ] Invariant cache hit.
[2023-03-19 08:54:10] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 249/673 places, 209/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 857 ms. Remains : 249/673 places, 209/603 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s182 0) (EQ s165 1)), p0:(OR (EQ s53 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 88 reset in 377 ms.
Product exploration explored 100000 steps with 104 reset in 323 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2466 steps, including 0 resets, run visited all 2 properties in 58 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 480 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 209/209 transitions.
Applied a total of 0 rules in 8 ms. Remains 249 /249 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2023-03-19 08:54:12] [INFO ] Invariant cache hit.
[2023-03-19 08:54:12] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-19 08:54:12] [INFO ] Invariant cache hit.
[2023-03-19 08:54:12] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-19 08:54:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 08:54:12] [INFO ] Invariant cache hit.
[2023-03-19 08:54:13] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 753 ms. Remains : 249/249 places, 209/209 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2327 steps, including 0 resets, run visited all 2 properties in 55 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 96 reset in 389 ms.
Product exploration explored 100000 steps with 96 reset in 358 ms.
Built C files in :
/tmp/ltsmin15057395826826866598
[2023-03-19 08:54:15] [INFO ] Computing symmetric may disable matrix : 209 transitions.
[2023-03-19 08:54:15] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:54:15] [INFO ] Computing symmetric may enable matrix : 209 transitions.
[2023-03-19 08:54:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:54:15] [INFO ] Computing Do-Not-Accords matrix : 209 transitions.
[2023-03-19 08:54:15] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:54:15] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15057395826826866598
Running compilation step : cd /tmp/ltsmin15057395826826866598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 439 ms.
Running link step : cd /tmp/ltsmin15057395826826866598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15057395826826866598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13981122362881074632.hoa' '--buchi-type=spotba'
LTSmin run took 1574 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-15 finished in 8024 ms.
All properties solved by simple procedures.
Total runtime 71562 ms.

BK_STOP 1679216057494

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-010B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPt-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 r389-oct2-167903713800619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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