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-167903713800636.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-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 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.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 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 376K 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-020B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679217047632

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 09:10:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 09:10:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:10:50] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-19 09:10:50] [INFO ] Transformed 1563 places.
[2023-03-19 09:10:50] [INFO ] Transformed 1423 transitions.
[2023-03-19 09:10:50] [INFO ] Found NUPN structural information;
[2023-03-19 09:10:50] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 212 place count 1351 transition count 1211
Iterating global reduction 0 with 212 rules applied. Total rules applied 424 place count 1351 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1350 transition count 1210
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1350 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 1349 transition count 1209
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 1349 transition count 1209
Applied a total of 428 rules in 555 ms. Remains 1349 /1563 variables (removed 214) and now considering 1209/1423 (removed 214) transitions.
// Phase 1: matrix 1209 rows 1349 cols
[2023-03-19 09:10:51] [INFO ] Computed 221 place invariants in 25 ms
[2023-03-19 09:10:52] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-19 09:10:52] [INFO ] Invariant cache hit.
[2023-03-19 09:10:53] [INFO ] Implicit Places using invariants and state equation in 1753 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
[2023-03-19 09:10:53] [INFO ] Invariant cache hit.
[2023-03-19 09:10:54] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1349/1563 places, 1209/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3988 ms. Remains : 1349/1563 places, 1209/1423 transitions.
Support contains 47 out of 1349 places after structural reductions.
[2023-03-19 09:10:55] [INFO ] Flatten gal took : 107 ms
[2023-03-19 09:10:55] [INFO ] Flatten gal took : 120 ms
[2023-03-19 09:10:55] [INFO ] Input system was already deterministic with 1209 transitions.
Support contains 45 out of 1349 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 32) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-19 09:10:56] [INFO ] Invariant cache hit.
[2023-03-19 09:10:56] [INFO ] [Real]Absence check using 221 positive place invariants in 148 ms returned sat
[2023-03-19 09:10:57] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-19 09:10:57] [INFO ] [Nat]Absence check using 221 positive place invariants in 96 ms returned sat
[2023-03-19 09:11:00] [INFO ] After 1824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-19 09:11:00] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 8 ms to minimize.
[2023-03-19 09:11:00] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 5 ms to minimize.
[2023-03-19 09:11:01] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 1 ms to minimize.
[2023-03-19 09:11:01] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 1 ms to minimize.
[2023-03-19 09:11:01] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2023-03-19 09:11:02] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2023-03-19 09:11:02] [INFO ] Deduced a trap composed of 25 places in 368 ms of which 1 ms to minimize.
[2023-03-19 09:11:02] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2023-03-19 09:11:03] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 0 ms to minimize.
[2023-03-19 09:11:03] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 0 ms to minimize.
[2023-03-19 09:11:03] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 0 ms to minimize.
[2023-03-19 09:11:03] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 0 ms to minimize.
[2023-03-19 09:11:04] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 7 ms to minimize.
[2023-03-19 09:11:04] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2023-03-19 09:11:04] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 0 ms to minimize.
[2023-03-19 09:11:05] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2023-03-19 09:11:05] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2023-03-19 09:11:05] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 0 ms to minimize.
[2023-03-19 09:11:05] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2023-03-19 09:11:05] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2023-03-19 09:11:05] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 9 ms to minimize.
[2023-03-19 09:11:06] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2023-03-19 09:11:06] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 1 ms to minimize.
[2023-03-19 09:11:06] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2023-03-19 09:11:06] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2023-03-19 09:11:06] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 1 ms to minimize.
[2023-03-19 09:11:07] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 0 ms to minimize.
[2023-03-19 09:11:07] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2023-03-19 09:11:07] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 0 ms to minimize.
[2023-03-19 09:11:07] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7258 ms
[2023-03-19 09:11:07] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2023-03-19 09:11:08] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 0 ms to minimize.
[2023-03-19 09:11:08] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2023-03-19 09:11:08] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 0 ms to minimize.
[2023-03-19 09:11:08] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2023-03-19 09:11:09] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 1 ms to minimize.
[2023-03-19 09:11:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1558 ms
[2023-03-19 09:11:09] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 0 ms to minimize.
[2023-03-19 09:11:10] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 1 ms to minimize.
[2023-03-19 09:11:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 683 ms
[2023-03-19 09:11:10] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2023-03-19 09:11:10] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 1 ms to minimize.
[2023-03-19 09:11:11] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 23 ms to minimize.
[2023-03-19 09:11:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 745 ms
[2023-03-19 09:11:12] [INFO ] After 13789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1295 ms.
[2023-03-19 09:11:13] [INFO ] After 16397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 1 properties in 1155 ms.
Support contains 19 out of 1349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 269 place count 1349 transition count 940
Reduce places removed 269 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 273 rules applied. Total rules applied 542 place count 1080 transition count 936
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 546 place count 1076 transition count 936
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 546 place count 1076 transition count 780
Deduced a syphon composed of 156 places in 3 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 858 place count 920 transition count 780
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 863 place count 915 transition count 775
Iterating global reduction 3 with 5 rules applied. Total rules applied 868 place count 915 transition count 775
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 868 place count 915 transition count 772
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 874 place count 912 transition count 772
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1542 place count 578 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1543 place count 578 transition count 437
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1545 place count 577 transition count 436
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1657 place count 521 transition count 436
Partial Free-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 4 with 54 rules applied. Total rules applied 1711 place count 521 transition count 436
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1712 place count 520 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1713 place count 519 transition count 435
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1713 place count 519 transition count 433
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1717 place count 517 transition count 433
Applied a total of 1717 rules in 276 ms. Remains 517 /1349 variables (removed 832) and now considering 433/1209 (removed 776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 517/1349 places, 433/1209 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 433 rows 517 cols
[2023-03-19 09:11:15] [INFO ] Computed 220 place invariants in 5 ms
[2023-03-19 09:11:15] [INFO ] [Real]Absence check using 220 positive place invariants in 42 ms returned sat
[2023-03-19 09:11:15] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:11:15] [INFO ] [Nat]Absence check using 220 positive place invariants in 61 ms returned sat
[2023-03-19 09:11:16] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:11:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:16] [INFO ] After 46ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:11:16] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-19 09:11:16] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 433/433 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 516 transition count 432
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 516 transition count 427
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 511 transition count 427
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 510 transition count 426
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 510 transition count 426
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 510 transition count 425
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 509 transition count 425
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 505 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 502 transition count 421
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 502 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 500 transition count 419
Applied a total of 34 rules in 164 ms. Remains 500 /517 variables (removed 17) and now considering 419/433 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 500/517 places, 419/433 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 237270 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237270 steps, saw 186208 distinct states, run finished after 3003 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 419 rows 500 cols
[2023-03-19 09:11:19] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-19 09:11:19] [INFO ] [Real]Absence check using 220 positive place invariants in 45 ms returned sat
[2023-03-19 09:11:20] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:11:20] [INFO ] [Nat]Absence check using 220 positive place invariants in 43 ms returned sat
[2023-03-19 09:11:20] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:11:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:20] [INFO ] After 59ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:11:20] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-19 09:11:20] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 419/419 transitions.
Applied a total of 0 rules in 33 ms. Remains 500 /500 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 500/500 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 419/419 transitions.
Applied a total of 0 rules in 23 ms. Remains 500 /500 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2023-03-19 09:11:20] [INFO ] Invariant cache hit.
[2023-03-19 09:11:21] [INFO ] Implicit Places using invariants in 548 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 552 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/500 places, 419/419 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 496 transition count 417
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 496 transition count 417
Applied a total of 4 rules in 14 ms. Remains 496 /498 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 496 cols
[2023-03-19 09:11:21] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-19 09:11:21] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-19 09:11:21] [INFO ] Invariant cache hit.
[2023-03-19 09:11:22] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 496/500 places, 417/419 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1566 ms. Remains : 496/500 places, 417/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 202165 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202165 steps, saw 159997 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:11:25] [INFO ] Invariant cache hit.
[2023-03-19 09:11:25] [INFO ] [Real]Absence check using 218 positive place invariants in 43 ms returned sat
[2023-03-19 09:11:25] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:11:25] [INFO ] [Nat]Absence check using 218 positive place invariants in 56 ms returned sat
[2023-03-19 09:11:26] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:11:26] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-19 09:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-19 09:11:26] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-19 09:11:26] [INFO ] After 722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 417/417 transitions.
Applied a total of 0 rules in 22 ms. Remains 496 /496 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 496/496 places, 417/417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 417/417 transitions.
Applied a total of 0 rules in 50 ms. Remains 496 /496 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-19 09:11:26] [INFO ] Invariant cache hit.
[2023-03-19 09:11:26] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-19 09:11:26] [INFO ] Invariant cache hit.
[2023-03-19 09:11:27] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2023-03-19 09:11:27] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-19 09:11:27] [INFO ] Invariant cache hit.
[2023-03-19 09:11:28] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1468 ms. Remains : 496/496 places, 417/417 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 496 transition count 417
Applied a total of 117 rules in 48 ms. Remains 496 /496 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 417 rows 496 cols
[2023-03-19 09:11:28] [INFO ] Computed 218 place invariants in 9 ms
[2023-03-19 09:11:28] [INFO ] [Real]Absence check using 218 positive place invariants in 31 ms returned sat
[2023-03-19 09:11:28] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:11:28] [INFO ] [Nat]Absence check using 218 positive place invariants in 39 ms returned sat
[2023-03-19 09:11:28] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:11:28] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-19 09:11:28] [INFO ] After 76ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:11:28] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2023-03-19 09:11:29] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2023-03-19 09:11:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2023-03-19 09:11:29] [INFO ] After 613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-19 09:11:29] [INFO ] After 1084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 321 stabilizing places and 321 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((p0&&X(G((p0||G(p1)))))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 94 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-19 09:11:29] [INFO ] Computed 221 place invariants in 17 ms
[2023-03-19 09:11:30] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 09:11:30] [INFO ] Invariant cache hit.
[2023-03-19 09:11:31] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
[2023-03-19 09:11:31] [INFO ] Invariant cache hit.
[2023-03-19 09:11:32] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2984 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 467 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s1246 1), p1:(OR (NEQ s322 1) (NEQ s371 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 68416 steps with 0 reset in 506 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-00 finished in 4054 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(p0)||G(p1)))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1348 transition count 930
Reduce places removed 278 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 557 place count 1070 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 1069 transition count 929
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 558 place count 1069 transition count 775
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 866 place count 915 transition count 775
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 872 place count 909 transition count 769
Iterating global reduction 3 with 6 rules applied. Total rules applied 878 place count 909 transition count 769
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 878 place count 909 transition count 765
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1560 place count 568 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1561 place count 568 transition count 427
Renaming transitions due to excessive name length > 1024 char.
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 1563 place count 567 transition count 426
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1677 place count 510 transition count 426
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1679 place count 508 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1680 place count 507 transition count 424
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1680 place count 507 transition count 422
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 1684 place count 505 transition count 422
Applied a total of 1684 rules in 230 ms. Remains 505 /1349 variables (removed 844) and now considering 422/1209 (removed 787) transitions.
// Phase 1: matrix 422 rows 505 cols
[2023-03-19 09:11:34] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-19 09:11:34] [INFO ] Implicit Places using invariants in 291 ms returned [488, 492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 306 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1349 places, 422/1209 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 501 transition count 420
Applied a total of 4 rules in 14 ms. Remains 501 /503 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-19 09:11:34] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:34] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-19 09:11:34] [INFO ] Invariant cache hit.
[2023-03-19 09:11:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:35] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 501/1349 places, 420/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1536 ms. Remains : 501/1349 places, 420/1209 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s380 1), p0:(OR (EQ s429 1) (EQ s103 0) (EQ s374 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-02 finished in 1750 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||(X((p2 U p3))&&p1))) U p4))))'
Support contains 7 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 173 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-19 09:11:35] [INFO ] Computed 221 place invariants in 10 ms
[2023-03-19 09:11:36] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-19 09:11:36] [INFO ] Invariant cache hit.
[2023-03-19 09:11:37] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
[2023-03-19 09:11:37] [INFO ] Invariant cache hit.
[2023-03-19 09:11:38] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2851 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 447 ms :[(NOT p4), (NOT p4), (NOT p4), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p4), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p4) (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p4:(AND (EQ s645 1) (EQ s682 1)), p0:(EQ s86 1), p1:(AND (EQ s1307 1) (EQ s1331 1)), p3:(EQ s884 1), p2:(EQ s483 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 541 ms.
Stack based approach found an accepted trace after 3822 steps with 0 reset with depth 3823 and stack size 3823 in 26 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-04 finished in 3913 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((X(p1)&&p0)))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 99 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-19 09:11:39] [INFO ] Computed 221 place invariants in 11 ms
[2023-03-19 09:11:40] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-19 09:11:40] [INFO ] Invariant cache hit.
[2023-03-19 09:11:41] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2023-03-19 09:11:41] [INFO ] Invariant cache hit.
[2023-03-19 09:11:42] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3020 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s90 1) (EQ s1013 0)), p1:(OR (AND (EQ s42 1) (EQ s1275 1)) (EQ s1275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 577 ms.
Stack based approach found an accepted trace after 444 steps with 0 reset with depth 445 and stack size 445 in 3 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-05 finished in 3709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 878 place count 906 transition count 766
Iterating global reduction 2 with 6 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1568 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1569 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
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 1571 place count 563 transition count 422
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1689 place count 504 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1692 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1692 place count 501 transition count 418
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 1696 place count 499 transition count 418
Applied a total of 1696 rules in 159 ms. Remains 499 /1349 variables (removed 850) and now considering 418/1209 (removed 791) transitions.
// Phase 1: matrix 418 rows 499 cols
[2023-03-19 09:11:43] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-19 09:11:43] [INFO ] Implicit Places using invariants in 329 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 331 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1349 places, 418/1209 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 495 transition count 416
Applied a total of 4 rules in 14 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2023-03-19 09:11:43] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:44] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-19 09:11:44] [INFO ] Invariant cache hit.
[2023-03-19 09:11:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 09:11:44] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1349 places, 416/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1467 ms. Remains : 495/1349 places, 416/1209 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s249 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 455 ms.
Product exploration explored 100000 steps with 32 reset in 648 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/495 stabilizing places and 2/416 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 264 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 18 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-03-19 09:11:46] [INFO ] Invariant cache hit.
[2023-03-19 09:11:47] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-19 09:11:47] [INFO ] Invariant cache hit.
[2023-03-19 09:11:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 09:11:47] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2023-03-19 09:11:47] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 09:11:47] [INFO ] Invariant cache hit.
[2023-03-19 09:11:48] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1437 ms. Remains : 495/495 places, 416/416 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/495 stabilizing places and 2/416 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 328 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 581 ms.
Product exploration explored 100000 steps with 1 reset in 651 ms.
Built C files in :
/tmp/ltsmin1880686784182397165
[2023-03-19 09:11:50] [INFO ] Computing symmetric may disable matrix : 416 transitions.
[2023-03-19 09:11:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:50] [INFO ] Computing symmetric may enable matrix : 416 transitions.
[2023-03-19 09:11:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:50] [INFO ] Computing Do-Not-Accords matrix : 416 transitions.
[2023-03-19 09:11:50] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:50] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1880686784182397165
Running compilation step : cd /tmp/ltsmin1880686784182397165;'/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 1077 ms.
Running link step : cd /tmp/ltsmin1880686784182397165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 98 ms.
Running LTSmin : cd /tmp/ltsmin1880686784182397165;'/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/stateBased2731342636655746983.hoa' '--buchi-type=spotba'
LTSmin run took 2431 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-020B-LTLFireability-07 finished in 11157 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(p0)||F((p1&&G(p2)))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1348 transition count 931
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 1071 transition count 930
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 1070 transition count 930
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 556 place count 1070 transition count 773
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 870 place count 913 transition count 773
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 877 place count 906 transition count 766
Iterating global reduction 3 with 7 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1562 place count 567 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1563 place count 567 transition count 426
Renaming transitions due to excessive name length > 1024 char.
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 1565 place count 566 transition count 425
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1681 place count 508 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1683 place count 506 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1684 place count 505 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1684 place count 505 transition count 421
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 1688 place count 503 transition count 421
Applied a total of 1688 rules in 136 ms. Remains 503 /1349 variables (removed 846) and now considering 421/1209 (removed 788) transitions.
// Phase 1: matrix 421 rows 503 cols
[2023-03-19 09:11:54] [INFO ] Computed 220 place invariants in 8 ms
[2023-03-19 09:11:54] [INFO ] Implicit Places using invariants in 355 ms returned [486, 490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 356 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1349 places, 421/1209 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 499 transition count 419
Applied a total of 4 rules in 15 ms. Remains 499 /501 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 499 cols
[2023-03-19 09:11:54] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-19 09:11:55] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-19 09:11:55] [INFO ] Invariant cache hit.
[2023-03-19 09:11:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:55] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 499/1349 places, 419/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1575 ms. Remains : 499/1349 places, 419/1209 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s299 0), p1:(OR (EQ s384 0) (EQ s402 0)), p2:(EQ s26 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 482 ms.
Stack based approach found an accepted trace after 43414 steps with 0 reset with depth 43415 and stack size 38217 in 223 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-08 finished in 2593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 91 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-19 09:11:57] [INFO ] Computed 221 place invariants in 7 ms
[2023-03-19 09:11:57] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-19 09:11:57] [INFO ] Invariant cache hit.
[2023-03-19 09:11:58] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2023-03-19 09:11:58] [INFO ] Invariant cache hit.
[2023-03-19 09:11:59] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2680 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1143 1) (NEQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 477 ms.
Product exploration explored 100000 steps with 0 reset in 622 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246738 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246738 steps, saw 150680 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:12:04] [INFO ] Invariant cache hit.
[2023-03-19 09:12:04] [INFO ] [Real]Absence check using 221 positive place invariants in 111 ms returned sat
[2023-03-19 09:12:05] [INFO ] After 575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 09:12:05] [INFO ] Deduced a trap composed of 35 places in 266 ms of which 1 ms to minimize.
[2023-03-19 09:12:06] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 1 ms to minimize.
[2023-03-19 09:12:06] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 1 ms to minimize.
[2023-03-19 09:12:06] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 1 ms to minimize.
[2023-03-19 09:12:06] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 0 ms to minimize.
[2023-03-19 09:12:07] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 1 ms to minimize.
[2023-03-19 09:12:07] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 0 ms to minimize.
[2023-03-19 09:12:07] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 20 ms to minimize.
[2023-03-19 09:12:08] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 2 ms to minimize.
[2023-03-19 09:12:08] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 14 ms to minimize.
[2023-03-19 09:12:08] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 1 ms to minimize.
[2023-03-19 09:12:08] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 1 ms to minimize.
[2023-03-19 09:12:09] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 0 ms to minimize.
[2023-03-19 09:12:09] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 1 ms to minimize.
[2023-03-19 09:12:09] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2023-03-19 09:12:09] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 0 ms to minimize.
[2023-03-19 09:12:10] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 0 ms to minimize.
[2023-03-19 09:12:10] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2023-03-19 09:12:10] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 3 ms to minimize.
[2023-03-19 09:12:10] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2023-03-19 09:12:11] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2023-03-19 09:12:11] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 1 ms to minimize.
[2023-03-19 09:12:11] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 1 ms to minimize.
[2023-03-19 09:12:11] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-19 09:12:11] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2023-03-19 09:12:12] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6696 ms
[2023-03-19 09:12:12] [INFO ] After 7346ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:12:12] [INFO ] After 7715ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:12:12] [INFO ] [Nat]Absence check using 221 positive place invariants in 60 ms returned sat
[2023-03-19 09:12:13] [INFO ] After 703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:13] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 1 ms to minimize.
[2023-03-19 09:12:13] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2023-03-19 09:12:14] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 0 ms to minimize.
[2023-03-19 09:12:14] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 1 ms to minimize.
[2023-03-19 09:12:14] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
[2023-03-19 09:12:15] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 1 ms to minimize.
[2023-03-19 09:12:15] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 1 ms to minimize.
[2023-03-19 09:12:15] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 1 ms to minimize.
[2023-03-19 09:12:16] [INFO ] Deduced a trap composed of 27 places in 358 ms of which 1 ms to minimize.
[2023-03-19 09:12:16] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2023-03-19 09:12:16] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 1 ms to minimize.
[2023-03-19 09:12:17] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 1 ms to minimize.
[2023-03-19 09:12:17] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 1 ms to minimize.
[2023-03-19 09:12:17] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 0 ms to minimize.
[2023-03-19 09:12:17] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 1 ms to minimize.
[2023-03-19 09:12:18] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 0 ms to minimize.
[2023-03-19 09:12:18] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 0 ms to minimize.
[2023-03-19 09:12:18] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 0 ms to minimize.
[2023-03-19 09:12:18] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 0 ms to minimize.
[2023-03-19 09:12:19] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 1 ms to minimize.
[2023-03-19 09:12:19] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2023-03-19 09:12:19] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 0 ms to minimize.
[2023-03-19 09:12:19] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 1 ms to minimize.
[2023-03-19 09:12:19] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 1 ms to minimize.
[2023-03-19 09:12:20] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-19 09:12:20] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2023-03-19 09:12:20] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2023-03-19 09:12:20] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 1 ms to minimize.
[2023-03-19 09:12:20] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2023-03-19 09:12:21] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7801 ms
[2023-03-19 09:12:21] [INFO ] After 8572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-19 09:12:21] [INFO ] After 8990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1063 transition count 764
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 904 transition count 764
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1554 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
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 1557 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1673 place count 505 transition count 422
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1732 place count 505 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1733 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1734 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1734 place count 503 transition count 419
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 1738 place count 501 transition count 419
Applied a total of 1738 rules in 156 ms. Remains 501 /1341 variables (removed 840) and now considering 419/1201 (removed 782) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 501/1341 places, 419/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished Best-First random walk after 384 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=192 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 287 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 64 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-19 09:12:22] [INFO ] Invariant cache hit.
[2023-03-19 09:12:22] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-19 09:12:22] [INFO ] Invariant cache hit.
[2023-03-19 09:12:24] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
[2023-03-19 09:12:24] [INFO ] Invariant cache hit.
[2023-03-19 09:12:24] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2915 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 243461 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243461 steps, saw 148799 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:12:28] [INFO ] Invariant cache hit.
[2023-03-19 09:12:28] [INFO ] [Real]Absence check using 221 positive place invariants in 74 ms returned sat
[2023-03-19 09:12:29] [INFO ] After 809ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 09:12:29] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 1 ms to minimize.
[2023-03-19 09:12:30] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-19 09:12:30] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2023-03-19 09:12:30] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 0 ms to minimize.
[2023-03-19 09:12:31] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2023-03-19 09:12:31] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2023-03-19 09:12:31] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 1 ms to minimize.
[2023-03-19 09:12:31] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2023-03-19 09:12:32] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2023-03-19 09:12:32] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
[2023-03-19 09:12:32] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2023-03-19 09:12:32] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2023-03-19 09:12:33] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 1 ms to minimize.
[2023-03-19 09:12:33] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 1 ms to minimize.
[2023-03-19 09:12:33] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 1 ms to minimize.
[2023-03-19 09:12:33] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 0 ms to minimize.
[2023-03-19 09:12:34] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 1 ms to minimize.
[2023-03-19 09:12:34] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 1 ms to minimize.
[2023-03-19 09:12:34] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2023-03-19 09:12:35] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2023-03-19 09:12:35] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2023-03-19 09:12:35] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2023-03-19 09:12:35] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2023-03-19 09:12:35] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2023-03-19 09:12:36] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2023-03-19 09:12:36] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6518 ms
[2023-03-19 09:12:36] [INFO ] After 7407ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:12:36] [INFO ] After 7795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:12:36] [INFO ] [Nat]Absence check using 221 positive place invariants in 62 ms returned sat
[2023-03-19 09:12:37] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:37] [INFO ] Deduced a trap composed of 35 places in 491 ms of which 1 ms to minimize.
[2023-03-19 09:12:38] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 1 ms to minimize.
[2023-03-19 09:12:38] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 0 ms to minimize.
[2023-03-19 09:12:38] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 1 ms to minimize.
[2023-03-19 09:12:39] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-19 09:12:39] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 2 ms to minimize.
[2023-03-19 09:12:39] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 0 ms to minimize.
[2023-03-19 09:12:40] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 0 ms to minimize.
[2023-03-19 09:12:40] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 1 ms to minimize.
[2023-03-19 09:12:40] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 0 ms to minimize.
[2023-03-19 09:12:40] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2023-03-19 09:12:41] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 1 ms to minimize.
[2023-03-19 09:12:41] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 1 ms to minimize.
[2023-03-19 09:12:41] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2023-03-19 09:12:42] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2023-03-19 09:12:42] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 1 ms to minimize.
[2023-03-19 09:12:42] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 1 ms to minimize.
[2023-03-19 09:12:42] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 1 ms to minimize.
[2023-03-19 09:12:43] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 0 ms to minimize.
[2023-03-19 09:12:43] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 0 ms to minimize.
[2023-03-19 09:12:43] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 1 ms to minimize.
[2023-03-19 09:12:43] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 0 ms to minimize.
[2023-03-19 09:12:44] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-19 09:12:44] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 0 ms to minimize.
[2023-03-19 09:12:44] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2023-03-19 09:12:44] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 0 ms to minimize.
[2023-03-19 09:12:44] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 0 ms to minimize.
[2023-03-19 09:12:45] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 0 ms to minimize.
[2023-03-19 09:12:45] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2023-03-19 09:12:45] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8352 ms
[2023-03-19 09:12:45] [INFO ] After 9030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-19 09:12:45] [INFO ] After 9414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1063 transition count 764
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 904 transition count 764
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1554 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
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 1557 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1673 place count 505 transition count 422
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1732 place count 505 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1733 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1734 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1734 place count 503 transition count 419
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 1738 place count 501 transition count 419
Applied a total of 1738 rules in 155 ms. Remains 501 /1341 variables (removed 840) and now considering 419/1201 (removed 782) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 501/1341 places, 419/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished Best-First random walk after 613 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=204 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 281 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 531 ms.
Product exploration explored 100000 steps with 0 reset in 630 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 278 place count 1341 transition count 1281
Deduced a syphon composed of 378 places in 2 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 378 place count 1341 transition count 1281
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 1 with 379 rules applied. Total rules applied 757 place count 1341 transition count 1282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 758 place count 1341 transition count 1281
Renaming transitions due to excessive name length > 1024 char.
Discarding 140 places :
Symmetric choice reduction at 2 with 140 rule applications. Total rules 898 place count 1201 transition count 1141
Deduced a syphon composed of 617 places in 1 ms
Iterating global reduction 2 with 140 rules applied. Total rules applied 1038 place count 1201 transition count 1141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 618 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1039 place count 1201 transition count 1141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1041 place count 1199 transition count 1139
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1043 place count 1199 transition count 1139
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -330
Deduced a syphon composed of 694 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1121 place count 1199 transition count 1469
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1199 place count 1121 transition count 1313
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1277 place count 1121 transition count 1313
Deduced a syphon composed of 616 places in 0 ms
Applied a total of 1277 rules in 642 ms. Remains 1121 /1341 variables (removed 220) and now considering 1313/1201 (removed -112) transitions.
[2023-03-19 09:12:48] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1313 rows 1121 cols
[2023-03-19 09:12:48] [INFO ] Computed 221 place invariants in 16 ms
[2023-03-19 09:12:49] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1341 places, 1313/1201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1595 ms. Remains : 1121/1341 places, 1313/1201 transitions.
Built C files in :
/tmp/ltsmin11584594935756309893
[2023-03-19 09:12:49] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11584594935756309893
Running compilation step : cd /tmp/ltsmin11584594935756309893;'/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 2036 ms.
Running link step : cd /tmp/ltsmin11584594935756309893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin11584594935756309893;'/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/stateBased11214965816476972428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 99 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-19 09:13:05] [INFO ] Computed 221 place invariants in 5 ms
[2023-03-19 09:13:05] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-19 09:13:05] [INFO ] Invariant cache hit.
[2023-03-19 09:13:06] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2023-03-19 09:13:06] [INFO ] Invariant cache hit.
[2023-03-19 09:13:07] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2417 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Built C files in :
/tmp/ltsmin8867106041112585686
[2023-03-19 09:13:07] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8867106041112585686
Running compilation step : cd /tmp/ltsmin8867106041112585686;'/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 2066 ms.
Running link step : cd /tmp/ltsmin8867106041112585686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8867106041112585686;'/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/stateBased8101886464196977512.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 09:13:22] [INFO ] Flatten gal took : 43 ms
[2023-03-19 09:13:22] [INFO ] Flatten gal took : 43 ms
[2023-03-19 09:13:22] [INFO ] Time to serialize gal into /tmp/LTL17624884502541044628.gal : 9 ms
[2023-03-19 09:13:22] [INFO ] Time to serialize properties into /tmp/LTL15481551079748932370.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17624884502541044628.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11795446993848744353.hoa' '-atoms' '/tmp/LTL15481551079748932370.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15481551079748932370.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11795446993848744353.hoa
Detected timeout of ITS tools.
[2023-03-19 09:13:37] [INFO ] Flatten gal took : 38 ms
[2023-03-19 09:13:37] [INFO ] Flatten gal took : 37 ms
[2023-03-19 09:13:37] [INFO ] Time to serialize gal into /tmp/LTL10977597903957446308.gal : 7 ms
[2023-03-19 09:13:38] [INFO ] Time to serialize properties into /tmp/LTL10167061946574089680.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10977597903957446308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10167061946574089680.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("((p1328!=1)||(p242!=1))"))))
Formula 0 simplified : XF!"((p1328!=1)||(p242!=1))"
Detected timeout of ITS tools.
[2023-03-19 09:13:53] [INFO ] Flatten gal took : 68 ms
[2023-03-19 09:13:53] [INFO ] Applying decomposition
[2023-03-19 09:13:53] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5294113846570989701.txt' '-o' '/tmp/graph5294113846570989701.bin' '-w' '/tmp/graph5294113846570989701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5294113846570989701.bin' '-l' '-1' '-v' '-w' '/tmp/graph5294113846570989701.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:13:53] [INFO ] Decomposing Gal with order
[2023-03-19 09:13:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:13:53] [INFO ] Removed a total of 202 redundant transitions.
[2023-03-19 09:13:53] [INFO ] Flatten gal took : 131 ms
[2023-03-19 09:13:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-19 09:13:53] [INFO ] Time to serialize gal into /tmp/LTL7487366861043915277.gal : 15 ms
[2023-03-19 09:13:53] [INFO ] Time to serialize properties into /tmp/LTL13539326863522798569.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7487366861043915277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13539326863522798569.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("((i16.u409.p1328!=1)||(i2.u73.p242!=1))"))))
Formula 0 simplified : XF!"((i16.u409.p1328!=1)||(i2.u73.p242!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12114627373548904428
[2023-03-19 09:14:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12114627373548904428
Running compilation step : cd /tmp/ltsmin12114627373548904428;'/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 2169 ms.
Running link step : cd /tmp/ltsmin12114627373548904428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin12114627373548904428;'/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' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-09 finished in 146977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0&&F(p1))) U G(p2)))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 98 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
[2023-03-19 09:14:24] [INFO ] Invariant cache hit.
[2023-03-19 09:14:24] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-19 09:14:24] [INFO ] Invariant cache hit.
[2023-03-19 09:14:25] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2023-03-19 09:14:25] [INFO ] Invariant cache hit.
[2023-03-19 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2645 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s50 1), p0:(EQ s80 1), p1:(EQ s432 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, 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-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-10 finished in 3058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&X(X(F(p1)))))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 125 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
[2023-03-19 09:14:27] [INFO ] Invariant cache hit.
[2023-03-19 09:14:27] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-19 09:14:27] [INFO ] Invariant cache hit.
[2023-03-19 09:14:29] [INFO ] Implicit Places using invariants and state equation in 1822 ms returned []
Implicit Place search using SMT with State Equation took 2391 ms to find 0 implicit places.
[2023-03-19 09:14:29] [INFO ] Invariant cache hit.
[2023-03-19 09:14:30] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3322 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 386 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s1027 1) (EQ s1052 1)), p1:(AND (EQ s586 1) (EQ s635 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 463 ms.
Product exploration explored 100000 steps with 44 reset in 501 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:14:32] [INFO ] Invariant cache hit.
[2023-03-19 09:14:32] [INFO ] [Real]Absence check using 221 positive place invariants in 103 ms returned sat
[2023-03-19 09:14:33] [INFO ] After 543ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 09:14:33] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 1 ms to minimize.
[2023-03-19 09:14:33] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 0 ms to minimize.
[2023-03-19 09:14:34] [INFO ] Deduced a trap composed of 34 places in 470 ms of which 0 ms to minimize.
[2023-03-19 09:14:34] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 0 ms to minimize.
[2023-03-19 09:14:35] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 1 ms to minimize.
[2023-03-19 09:14:35] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 0 ms to minimize.
[2023-03-19 09:14:35] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2023-03-19 09:14:36] [INFO ] Deduced a trap composed of 20 places in 347 ms of which 1 ms to minimize.
[2023-03-19 09:14:36] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 0 ms to minimize.
[2023-03-19 09:14:36] [INFO ] Deduced a trap composed of 34 places in 323 ms of which 1 ms to minimize.
[2023-03-19 09:14:36] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2023-03-19 09:14:37] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 1 ms to minimize.
[2023-03-19 09:14:37] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 0 ms to minimize.
[2023-03-19 09:14:37] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 0 ms to minimize.
[2023-03-19 09:14:38] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 1 ms to minimize.
[2023-03-19 09:14:38] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2023-03-19 09:14:38] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 0 ms to minimize.
[2023-03-19 09:14:38] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 0 ms to minimize.
[2023-03-19 09:14:39] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2023-03-19 09:14:39] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2023-03-19 09:14:39] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2023-03-19 09:14:39] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2023-03-19 09:14:39] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 0 ms to minimize.
[2023-03-19 09:14:40] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2023-03-19 09:14:40] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6876 ms
[2023-03-19 09:14:40] [INFO ] After 7522ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:14:40] [INFO ] After 7829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:14:40] [INFO ] [Nat]Absence check using 221 positive place invariants in 99 ms returned sat
[2023-03-19 09:14:41] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:14:41] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 1 ms to minimize.
[2023-03-19 09:14:42] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 0 ms to minimize.
[2023-03-19 09:14:42] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2023-03-19 09:14:42] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2023-03-19 09:14:42] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2023-03-19 09:14:43] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 0 ms to minimize.
[2023-03-19 09:14:43] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 1 ms to minimize.
[2023-03-19 09:14:43] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2023-03-19 09:14:43] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 0 ms to minimize.
[2023-03-19 09:14:44] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2023-03-19 09:14:44] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2023-03-19 09:14:44] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 1 ms to minimize.
[2023-03-19 09:14:45] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2023-03-19 09:14:45] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 1 ms to minimize.
[2023-03-19 09:14:45] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2023-03-19 09:14:45] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2023-03-19 09:14:45] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2023-03-19 09:14:46] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2023-03-19 09:14:46] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2023-03-19 09:14:46] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2023-03-19 09:14:46] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2023-03-19 09:14:46] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
[2023-03-19 09:14:47] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2023-03-19 09:14:47] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-19 09:14:47] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2023-03-19 09:14:47] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 0 ms to minimize.
[2023-03-19 09:14:47] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 1 ms to minimize.
[2023-03-19 09:14:48] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 1 ms to minimize.
[2023-03-19 09:14:48] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2023-03-19 09:14:48] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7064 ms
[2023-03-19 09:14:48] [INFO ] After 7903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-19 09:14:48] [INFO ] After 8306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 556 place count 1063 transition count 762
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1735 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1736 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1737 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1737 place count 501 transition count 418
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 1741 place count 499 transition count 418
Applied a total of 1741 rules in 199 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 499/1341 places, 418/1201 transitions.
Finished random walk after 1624 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=203 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 345 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 59 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-19 09:14:49] [INFO ] Invariant cache hit.
[2023-03-19 09:14:50] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-19 09:14:50] [INFO ] Invariant cache hit.
[2023-03-19 09:14:51] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2023-03-19 09:14:51] [INFO ] Invariant cache hit.
[2023-03-19 09:14:52] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2683 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:14:52] [INFO ] Invariant cache hit.
[2023-03-19 09:14:53] [INFO ] [Real]Absence check using 221 positive place invariants in 69 ms returned sat
[2023-03-19 09:14:53] [INFO ] After 621ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 09:14:54] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 1 ms to minimize.
[2023-03-19 09:14:54] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2023-03-19 09:14:55] [INFO ] Deduced a trap composed of 34 places in 341 ms of which 0 ms to minimize.
[2023-03-19 09:14:55] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2023-03-19 09:14:55] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 1 ms to minimize.
[2023-03-19 09:14:56] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 0 ms to minimize.
[2023-03-19 09:14:56] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 1 ms to minimize.
[2023-03-19 09:14:56] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 14 ms to minimize.
[2023-03-19 09:14:57] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 0 ms to minimize.
[2023-03-19 09:14:57] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 0 ms to minimize.
[2023-03-19 09:14:57] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 0 ms to minimize.
[2023-03-19 09:14:57] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2023-03-19 09:14:58] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 0 ms to minimize.
[2023-03-19 09:14:58] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-19 09:14:58] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 0 ms to minimize.
[2023-03-19 09:14:58] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2023-03-19 09:14:59] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 1 ms to minimize.
[2023-03-19 09:14:59] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 13 ms to minimize.
[2023-03-19 09:14:59] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2023-03-19 09:14:59] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2023-03-19 09:14:59] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-19 09:15:00] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2023-03-19 09:15:00] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 1 ms to minimize.
[2023-03-19 09:15:00] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2023-03-19 09:15:00] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6694 ms
[2023-03-19 09:15:00] [INFO ] After 7363ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:15:00] [INFO ] After 7736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:15:00] [INFO ] [Nat]Absence check using 221 positive place invariants in 51 ms returned sat
[2023-03-19 09:15:01] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:15:01] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 1 ms to minimize.
[2023-03-19 09:15:02] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 2 ms to minimize.
[2023-03-19 09:15:02] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 1 ms to minimize.
[2023-03-19 09:15:02] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-19 09:15:03] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 1 ms to minimize.
[2023-03-19 09:15:03] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 1 ms to minimize.
[2023-03-19 09:15:03] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2023-03-19 09:15:03] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 1 ms to minimize.
[2023-03-19 09:15:04] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 1 ms to minimize.
[2023-03-19 09:15:04] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2023-03-19 09:15:04] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 15 ms to minimize.
[2023-03-19 09:15:04] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 14 ms to minimize.
[2023-03-19 09:15:05] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 0 ms to minimize.
[2023-03-19 09:15:05] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 1 ms to minimize.
[2023-03-19 09:15:05] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 0 ms to minimize.
[2023-03-19 09:15:05] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2023-03-19 09:15:06] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2023-03-19 09:15:06] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 0 ms to minimize.
[2023-03-19 09:15:06] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 13 ms to minimize.
[2023-03-19 09:15:06] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 0 ms to minimize.
[2023-03-19 09:15:06] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2023-03-19 09:15:07] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2023-03-19 09:15:07] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2023-03-19 09:15:07] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-19 09:15:07] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2023-03-19 09:15:08] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2023-03-19 09:15:08] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2023-03-19 09:15:08] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-19 09:15:08] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2023-03-19 09:15:08] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7060 ms
[2023-03-19 09:15:08] [INFO ] After 7775ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-19 09:15:08] [INFO ] After 8110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 556 place count 1063 transition count 762
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
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 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1735 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1736 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1737 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1737 place count 501 transition count 418
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 1741 place count 499 transition count 418
Applied a total of 1741 rules in 121 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 499/1341 places, 418/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 43595 steps, run visited all 1 properties in 262 ms. (steps per millisecond=166 )
Probabilistic random walk after 43595 steps, saw 35814 distinct states, run finished after 262 ms. (steps per millisecond=166 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 258 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 44 reset in 497 ms.
Product exploration explored 100000 steps with 40 reset in 588 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 278 place count 1341 transition count 1280
Deduced a syphon composed of 378 places in 2 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 378 place count 1341 transition count 1280
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 1 with 378 rules applied. Total rules applied 756 place count 1341 transition count 1280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 757 place count 1341 transition count 1279
Renaming transitions due to excessive name length > 1024 char.
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 899 place count 1199 transition count 1137
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 142 rules applied. Total rules applied 1041 place count 1199 transition count 1137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 615 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1042 place count 1199 transition count 1137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1044 place count 1197 transition count 1135
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1046 place count 1197 transition count 1135
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -333
Deduced a syphon composed of 692 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1125 place count 1197 transition count 1468
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1204 place count 1118 transition count 1310
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1283 place count 1118 transition count 1310
Deduced a syphon composed of 613 places in 1 ms
Applied a total of 1283 rules in 331 ms. Remains 1118 /1341 variables (removed 223) and now considering 1310/1201 (removed -109) transitions.
[2023-03-19 09:15:12] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1310 rows 1118 cols
[2023-03-19 09:15:12] [INFO ] Computed 221 place invariants in 18 ms
[2023-03-19 09:15:13] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1118/1341 places, 1310/1201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1296 ms. Remains : 1118/1341 places, 1310/1201 transitions.
Built C files in :
/tmp/ltsmin107640337695131370
[2023-03-19 09:15:13] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin107640337695131370
Running compilation step : cd /tmp/ltsmin107640337695131370;'/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 2059 ms.
Running link step : cd /tmp/ltsmin107640337695131370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin107640337695131370;'/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/stateBased7637782278382246107.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 44 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-19 09:15:28] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-19 09:15:29] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-19 09:15:29] [INFO ] Invariant cache hit.
[2023-03-19 09:15:30] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
[2023-03-19 09:15:30] [INFO ] Invariant cache hit.
[2023-03-19 09:15:31] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2951 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Built C files in :
/tmp/ltsmin944991769540686803
[2023-03-19 09:15:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin944991769540686803
Running compilation step : cd /tmp/ltsmin944991769540686803;'/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 2105 ms.
Running link step : cd /tmp/ltsmin944991769540686803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin944991769540686803;'/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/stateBased7164431304878499506.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 09:15:46] [INFO ] Flatten gal took : 35 ms
[2023-03-19 09:15:46] [INFO ] Flatten gal took : 28 ms
[2023-03-19 09:15:46] [INFO ] Time to serialize gal into /tmp/LTL9912777497245804567.gal : 5 ms
[2023-03-19 09:15:46] [INFO ] Time to serialize properties into /tmp/LTL6855659902197982101.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9912777497245804567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10508109318495768782.hoa' '-atoms' '/tmp/LTL6855659902197982101.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6855659902197982101.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10508109318495768782.hoa
Detected timeout of ITS tools.
[2023-03-19 09:16:01] [INFO ] Flatten gal took : 64 ms
[2023-03-19 09:16:01] [INFO ] Flatten gal took : 40 ms
[2023-03-19 09:16:01] [INFO ] Time to serialize gal into /tmp/LTL8682755199877934773.gal : 5 ms
[2023-03-19 09:16:02] [INFO ] Time to serialize properties into /tmp/LTL8700608892494083615.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8682755199877934773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8700608892494083615.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((p1192!=1)||(p1219!=1))")))||((F("((p1192!=1)||(p1219!=1))"))&&(X(X(F("((p675==1)&&(p734==1))"))))))))
Formula 0 simplified : X(FG!"((p1192!=1)||(p1219!=1))" & (G!"((p1192!=1)||(p1219!=1))" | XXG!"((p675==1)&&(p734==1))"))
Detected timeout of ITS tools.
[2023-03-19 09:16:17] [INFO ] Flatten gal took : 40 ms
[2023-03-19 09:16:17] [INFO ] Applying decomposition
[2023-03-19 09:16:17] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17855769274728475784.txt' '-o' '/tmp/graph17855769274728475784.bin' '-w' '/tmp/graph17855769274728475784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17855769274728475784.bin' '-l' '-1' '-v' '-w' '/tmp/graph17855769274728475784.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:16:17] [INFO ] Decomposing Gal with order
[2023-03-19 09:16:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:16:17] [INFO ] Removed a total of 199 redundant transitions.
[2023-03-19 09:16:17] [INFO ] Flatten gal took : 65 ms
[2023-03-19 09:16:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2023-03-19 09:16:17] [INFO ] Time to serialize gal into /tmp/LTL7139296963335281718.gal : 17 ms
[2023-03-19 09:16:17] [INFO ] Time to serialize properties into /tmp/LTL10873187447740952987.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7139296963335281718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10873187447740952987.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i15.u371.p1192!=1)||(i15.u378.p1219!=1))")))||((F("((i15.u371.p1192!=1)||(i15.u378.p1219!=1))"))&&(X(X(F("((i8.u210.p675=...187
Formula 0 simplified : X(FG!"((i15.u371.p1192!=1)||(i15.u378.p1219!=1))" & (G!"((i15.u371.p1192!=1)||(i15.u378.p1219!=1))" | XXG!"((i8.u210.p675==1)&&(i9.u...171
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12968246342235232843
[2023-03-19 09:16:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12968246342235232843
Running compilation step : cd /tmp/ltsmin12968246342235232843;'/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 2241 ms.
Running link step : cd /tmp/ltsmin12968246342235232843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin12968246342235232843;'/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' '--ltl' 'X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-11 finished in 140653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1348 transition count 929
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1069 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 879 place count 905 transition count 765
Iterating global reduction 3 with 7 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 886 place count 905 transition count 760
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 896 place count 900 transition count 760
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1564 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1565 place count 566 transition count 425
Renaming transitions due to excessive name length > 1024 char.
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 1567 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1685 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1688 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 420
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 1692 place count 501 transition count 420
Applied a total of 1692 rules in 132 ms. Remains 501 /1349 variables (removed 848) and now considering 420/1209 (removed 789) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-19 09:16:47] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-19 09:16:48] [INFO ] Implicit Places using invariants in 316 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 332 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1349 places, 420/1209 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 497 transition count 418
Applied a total of 4 rules in 12 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-19 09:16:48] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-19 09:16:48] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-19 09:16:48] [INFO ] Invariant cache hit.
[2023-03-19 09:16:49] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1349 places, 418/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1353 ms. Remains : 497/1349 places, 418/1209 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s347 1) (EQ s363 1)), p1:(NEQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 59 reset in 452 ms.
Product exploration explored 100000 steps with 74 reset in 468 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 499 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:16:50] [INFO ] Invariant cache hit.
[2023-03-19 09:16:51] [INFO ] [Real]Absence check using 218 positive place invariants in 58 ms returned sat
[2023-03-19 09:16:51] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:16:51] [INFO ] [Nat]Absence check using 218 positive place invariants in 52 ms returned sat
[2023-03-19 09:16:51] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:16:51] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-19 09:16:51] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 497 transition count 418
Applied a total of 1 rules in 27 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 497/497 places, 418/418 transitions.
Finished random walk after 1052 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 639 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 16 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-19 09:16:52] [INFO ] Invariant cache hit.
[2023-03-19 09:16:52] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-19 09:16:52] [INFO ] Invariant cache hit.
[2023-03-19 09:16:53] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-19 09:16:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 09:16:53] [INFO ] Invariant cache hit.
[2023-03-19 09:16:53] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1330 ms. Remains : 497/497 places, 418/418 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:16:54] [INFO ] Invariant cache hit.
[2023-03-19 09:16:54] [INFO ] [Real]Absence check using 218 positive place invariants in 74 ms returned sat
[2023-03-19 09:16:54] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:16:54] [INFO ] [Nat]Absence check using 218 positive place invariants in 25 ms returned sat
[2023-03-19 09:16:54] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:16:54] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-19 09:16:54] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 497 transition count 418
Applied a total of 1 rules in 16 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 497/497 places, 418/418 transitions.
Finished random walk after 3189 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=187 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 391 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 63 reset in 398 ms.
Product exploration explored 100000 steps with 78 reset in 477 ms.
Built C files in :
/tmp/ltsmin3326004604887213662
[2023-03-19 09:16:56] [INFO ] Computing symmetric may disable matrix : 418 transitions.
[2023-03-19 09:16:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:16:56] [INFO ] Computing symmetric may enable matrix : 418 transitions.
[2023-03-19 09:16:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:16:56] [INFO ] Computing Do-Not-Accords matrix : 418 transitions.
[2023-03-19 09:16:56] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:16:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3326004604887213662
Running compilation step : cd /tmp/ltsmin3326004604887213662;'/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 961 ms.
Running link step : cd /tmp/ltsmin3326004604887213662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3326004604887213662;'/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/stateBased16442928274573825705.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 21 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-19 09:17:11] [INFO ] Invariant cache hit.
[2023-03-19 09:17:11] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-19 09:17:11] [INFO ] Invariant cache hit.
[2023-03-19 09:17:12] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-19 09:17:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 09:17:12] [INFO ] Invariant cache hit.
[2023-03-19 09:17:12] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1256 ms. Remains : 497/497 places, 418/418 transitions.
Built C files in :
/tmp/ltsmin10700344718579466432
[2023-03-19 09:17:12] [INFO ] Computing symmetric may disable matrix : 418 transitions.
[2023-03-19 09:17:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:17:12] [INFO ] Computing symmetric may enable matrix : 418 transitions.
[2023-03-19 09:17:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:17:12] [INFO ] Computing Do-Not-Accords matrix : 418 transitions.
[2023-03-19 09:17:12] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:17:12] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10700344718579466432
Running compilation step : cd /tmp/ltsmin10700344718579466432;'/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 934 ms.
Running link step : cd /tmp/ltsmin10700344718579466432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin10700344718579466432;'/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/stateBased15891939584117883731.hoa' '--buchi-type=spotba'
LTSmin run took 2809 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-020B-LTLFireability-12 finished in 28944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1))||(p2&&F(p3)))))'
Support contains 5 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 80 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-19 09:17:16] [INFO ] Computed 221 place invariants in 10 ms
[2023-03-19 09:17:17] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-19 09:17:17] [INFO ] Invariant cache hit.
[2023-03-19 09:17:18] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2023-03-19 09:17:18] [INFO ] Invariant cache hit.
[2023-03-19 09:17:19] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2792 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 403 ms :[true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(EQ s35 0), p0:(EQ s484 1), p2:(EQ s936 1), p1:(OR (EQ s52 0) (EQ s54 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-13 finished in 3220 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' '!(((p0 U p1)||X((G(p2)&&F((p3&&X(p4)))))))'
Support contains 5 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 98 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-19 09:17:19] [INFO ] Computed 221 place invariants in 11 ms
[2023-03-19 09:17:20] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-19 09:17:20] [INFO ] Invariant cache hit.
[2023-03-19 09:17:21] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2023-03-19 09:17:21] [INFO ] Invariant cache hit.
[2023-03-19 09:17:22] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2575 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p4) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (NOT p2), (AND (NOT p1) (NOT p2)), true, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p4) (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 p3 (NOT p4)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p4), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p4)), acceptance={0} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2 p3 (NOT p4)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2 p3 (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p4), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0 p2 p4), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 8}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p2 p3), acceptance={0} source=6 dest: 0}, { cond=(NOT p2), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=5, aps=[p2:(AND (EQ s970 1) (EQ s972 1)), p3:(EQ s870 0), p4:(EQ s207 0), p1:(EQ s870 1), p0:(EQ s1011 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-14 finished in 3056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ShieldPPPt-PT-020B-LTLFireability-09
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 560 place count 1068 transition count 773
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 870 place count 913 transition count 773
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 877 place count 906 transition count 766
Iterating global reduction 2 with 7 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1566 place count 565 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1567 place count 565 transition count 424
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1569 place count 564 transition count 423
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1685 place count 506 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1687 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1688 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 419
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 1692 place count 501 transition count 419
Applied a total of 1692 rules in 218 ms. Remains 501 /1349 variables (removed 848) and now considering 419/1209 (removed 790) transitions.
// Phase 1: matrix 419 rows 501 cols
[2023-03-19 09:17:23] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-19 09:17:23] [INFO ] Implicit Places using invariants in 439 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 441 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/1349 places, 419/1209 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 497 transition count 417
Applied a total of 4 rules in 11 ms. Remains 497 /499 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 497 cols
[2023-03-19 09:17:23] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:17:24] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-19 09:17:24] [INFO ] Invariant cache hit.
[2023-03-19 09:17:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:17:24] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 497/1349 places, 417/1209 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1550 ms. Remains : 497/1349 places, 417/1209 transitions.
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s430 1) (NEQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 486 ms.
Product exploration explored 100000 steps with 0 reset in 471 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Finished Best-First random walk after 136 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 417/417 transitions.
Applied a total of 0 rules in 9 ms. Remains 497 /497 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-19 09:17:26] [INFO ] Invariant cache hit.
[2023-03-19 09:17:27] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-19 09:17:27] [INFO ] Invariant cache hit.
[2023-03-19 09:17:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:17:27] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
[2023-03-19 09:17:27] [INFO ] Invariant cache hit.
[2023-03-19 09:17:28] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1408 ms. Remains : 497/497 places, 417/417 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished Best-First random walk after 330 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=165 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 503 ms.
Product exploration explored 100000 steps with 0 reset in 527 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 417/417 transitions.
Applied a total of 0 rules in 14 ms. Remains 497 /497 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-19 09:17:30] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 09:17:30] [INFO ] Invariant cache hit.
[2023-03-19 09:17:30] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 497/497 places, 417/417 transitions.
Built C files in :
/tmp/ltsmin12344293092711638316
[2023-03-19 09:17:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12344293092711638316
Running compilation step : cd /tmp/ltsmin12344293092711638316;'/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 720 ms.
Running link step : cd /tmp/ltsmin12344293092711638316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin12344293092711638316;'/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/stateBased8134593639968078559.hoa' '--buchi-type=spotba'
LTSmin run took 762 ms.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-09 finished in 9171 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&X(X(F(p1)))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-020B-LTLFireability-11
Stuttering acceptance computed with spot in 243 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 879 place count 905 transition count 765
Iterating global reduction 2 with 7 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 886 place count 905 transition count 760
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 896 place count 900 transition count 760
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1564 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1565 place count 566 transition count 425
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1567 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1685 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1688 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 420
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 1692 place count 501 transition count 420
Applied a total of 1692 rules in 111 ms. Remains 501 /1349 variables (removed 848) and now considering 420/1209 (removed 789) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-19 09:17:32] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-19 09:17:32] [INFO ] Implicit Places using invariants in 338 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 339 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/1349 places, 420/1209 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 497 transition count 418
Applied a total of 4 rules in 9 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-19 09:17:32] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-19 09:17:33] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-19 09:17:33] [INFO ] Invariant cache hit.
[2023-03-19 09:17:33] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 497/1349 places, 418/1209 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1368 ms. Remains : 497/1349 places, 418/1209 transitions.
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s383 1) (EQ s399 1)), p1:(AND (EQ s220 1) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 197 reset in 385 ms.
Stack based approach found an accepted trace after 36038 steps with 71 reset with depth 1089 and stack size 910 in 183 ms.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-11 finished in 2256 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 09:17:34] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14635952532973762528
[2023-03-19 09:17:34] [INFO ] Applying decomposition
[2023-03-19 09:17:34] [INFO ] Computing symmetric may disable matrix : 1209 transitions.
[2023-03-19 09:17:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:17:34] [INFO ] Computing symmetric may enable matrix : 1209 transitions.
[2023-03-19 09:17:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:17:34] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7990542677545069.txt' '-o' '/tmp/graph7990542677545069.bin' '-w' '/tmp/graph7990542677545069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7990542677545069.bin' '-l' '-1' '-v' '-w' '/tmp/graph7990542677545069.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:17:34] [INFO ] Decomposing Gal with order
[2023-03-19 09:17:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:17:34] [INFO ] Computing Do-Not-Accords matrix : 1209 transitions.
[2023-03-19 09:17:34] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:17:34] [INFO ] Built C files in 238ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14635952532973762528
Running compilation step : cd /tmp/ltsmin14635952532973762528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
[2023-03-19 09:17:34] [INFO ] Removed a total of 199 redundant transitions.
[2023-03-19 09:17:34] [INFO ] Flatten gal took : 69 ms
[2023-03-19 09:17:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-19 09:17:34] [INFO ] Time to serialize gal into /tmp/LTLFireability7607022952734905482.gal : 22 ms
[2023-03-19 09:17:34] [INFO ] Time to serialize properties into /tmp/LTLFireability17239133363452259422.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7607022952734905482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17239133363452259422.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F(!("((i14.i1.i1.u371.p1192==1)&&(i14.i2.i1.u377.p1219==1))"))))||((F(!("((i14.i1.i1.u371.p1192==1)&&(i14.i2.i1.u377.p1219==1)...223
Formula 0 simplified : X(FG"((i14.i1.i1.u371.p1192==1)&&(i14.i2.i1.u377.p1219==1))" & (G"((i14.i1.i1.u371.p1192==1)&&(i14.i2.i1.u377.p1219==1))" | XXG!"((i...199
Compilation finished in 3733 ms.
Running link step : cd /tmp/ltsmin14635952532973762528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin14635952532973762528;'/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' '--ltl' 'X(([](<>(!(LTLAPp1==true)))||(<>(!(LTLAPp1==true))&&X(X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.336: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.337: LTL layer: formula: X(([](<>(!(LTLAPp1==true)))||(<>(!(LTLAPp1==true))&&X(X(<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.413: "X(([](<>(!(LTLAPp1==true)))||(<>(!(LTLAPp1==true))&&X(X(<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.414: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.426: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.458: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.480: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.482: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.487: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.488: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.534: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.548: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.063: DFS-FIFO for weak LTL, using special progress label 1213
pins2lts-mc-linux64( 0/ 8), 1.064: There are 1214 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.064: State length is 1350, there are 1218 groups
pins2lts-mc-linux64( 0/ 8), 1.064: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.064: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.064: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.064: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 1.192: ~1 levels ~960 states ~5872 transitions
pins2lts-mc-linux64( 5/ 8), 1.262: ~1 levels ~1920 states ~12464 transitions
pins2lts-mc-linux64( 5/ 8), 1.475: ~1 levels ~3840 states ~26912 transitions
pins2lts-mc-linux64( 5/ 8), 1.782: ~1 levels ~7680 states ~57224 transitions
pins2lts-mc-linux64( 5/ 8), 2.484: ~1 levels ~15360 states ~121928 transitions
pins2lts-mc-linux64( 5/ 8), 3.709: ~1 levels ~30720 states ~258896 transitions
pins2lts-mc-linux64( 5/ 8), 6.178: ~1 levels ~61440 states ~550816 transitions
pins2lts-mc-linux64( 0/ 8), 10.931: ~1 levels ~122880 states ~1103016 transitions
pins2lts-mc-linux64( 0/ 8), 20.022: ~1 levels ~245760 states ~2309080 transitions
pins2lts-mc-linux64( 0/ 8), 38.022: ~1 levels ~491520 states ~4939376 transitions
pins2lts-mc-linux64( 0/ 8), 72.535: ~1 levels ~983040 states ~10129584 transitions
pins2lts-mc-linux64( 0/ 8), 144.448: ~1 levels ~1966080 states ~21458608 transitions
pins2lts-mc-linux64( 0/ 8), 288.692: ~1 levels ~3932160 states ~45169672 transitions
pins2lts-mc-linux64( 0/ 8), 581.063: ~1 levels ~7864320 states ~95282680 transitions
pins2lts-mc-linux64( 3/ 8), 1041.170: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1041.284:
pins2lts-mc-linux64( 0/ 8), 1041.285: mean standard work distribution: 10.9% (states) 11.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1041.285:
pins2lts-mc-linux64( 0/ 8), 1041.285: Explored 12433909 states 161477402 transitions, fanout: 12.987
pins2lts-mc-linux64( 0/ 8), 1041.285: Total exploration time 1040.210 sec (1040.090 sec minimum, 1040.137 sec on average)
pins2lts-mc-linux64( 0/ 8), 1041.285: States per second: 11953, Transitions per second: 155235
pins2lts-mc-linux64( 0/ 8), 1041.285:
pins2lts-mc-linux64( 0/ 8), 1041.285: Progress states detected: 31527272
pins2lts-mc-linux64( 0/ 8), 1041.285: Redundant explorations: -60.5615
pins2lts-mc-linux64( 0/ 8), 1041.285:
pins2lts-mc-linux64( 0/ 8), 1041.285: Queue width: 8B, total height: 29864616, memory: 227.85MB
pins2lts-mc-linux64( 0/ 8), 1041.285: Tree memory: 496.5MB, 16.5 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1041.285: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1041.285: Stored 1240 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1041.285: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1041.285: Est. total memory use: 724.4MB (~1251.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14635952532973762528;'/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' '--ltl' 'X(([](<>(!(LTLAPp1==true)))||(<>(!(LTLAPp1==true))&&X(X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14635952532973762528;'/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' '--ltl' 'X(([](<>(!(LTLAPp1==true)))||(<>(!(LTLAPp1==true))&&X(X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 09:39:50] [INFO ] Applying decomposition
[2023-03-19 09:39:51] [INFO ] Flatten gal took : 372 ms
[2023-03-19 09:39:51] [INFO ] Decomposing Gal with order
[2023-03-19 09:39:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:39:52] [INFO ] Removed a total of 58 redundant transitions.
[2023-03-19 09:39:52] [INFO ] Flatten gal took : 619 ms
[2023-03-19 09:39:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 1419 ms.
[2023-03-19 09:39:54] [INFO ] Time to serialize gal into /tmp/LTLFireability12742510319388598929.gal : 145 ms
[2023-03-19 09:39:54] [INFO ] Time to serialize properties into /tmp/LTLFireability11672031091675506700.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12742510319388598929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11672031091675506700.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((G(F(!("((i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u345.p1192==1)&&(i0.i0.i0.i0.i1.i0.i0.i0.u353.p1219==1))"))))||((F(!("((i0.i0.i0.i0...387
Formula 0 simplified : X(FG"((i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u345.p1192==1)&&(i0.i0.i0.i0.i1.i0.i0.i0.u353.p1219==1))" & (G"((i0.i0.i0.i0.i1.i0.i0.i0....363
Detected timeout of ITS tools.
[2023-03-19 10:02:18] [INFO ] Flatten gal took : 704 ms
[2023-03-19 10:02:25] [INFO ] Input system was already deterministic with 1209 transitions.
[2023-03-19 10:02:25] [INFO ] Transformed 1349 places.
[2023-03-19 10:02:25] [INFO ] Transformed 1209 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 10:02:26] [INFO ] Time to serialize gal into /tmp/LTLFireability15106741727841698412.gal : 32 ms
[2023-03-19 10:02:26] [INFO ] Time to serialize properties into /tmp/LTLFireability13460346553280745881.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15106741727841698412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13460346553280745881.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(F(!("((p1192==1)&&(p1219==1))"))))||((F(!("((p1192==1)&&(p1219==1))")))&&(X(X(F("((p675==1)&&(p734==1))"))))))))
Formula 0 simplified : X(FG"((p1192==1)&&(p1219==1))" & (G"((p1192==1)&&(p1219==1))" | XXG!"((p675==1)&&(p734==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5299484 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16019028 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-020B"
export BK_EXAMINATION="LTLFireability"
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-020B, examination is LTLFireability"
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-167903713800636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;