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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 02:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 172K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679200250253

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 04:30:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 04:30:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:30:53] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-19 04:30:53] [INFO ] Transformed 683 places.
[2023-03-19 04:30:53] [INFO ] Transformed 633 transitions.
[2023-03-19 04:30:53] [INFO ] Found NUPN structural information;
[2023-03-19 04:30:53] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-010B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 633/633 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 621 transition count 571
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 621 transition count 571
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 620 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 620 transition count 570
Applied a total of 126 rules in 127 ms. Remains 620 /683 variables (removed 63) and now considering 570/633 (removed 63) transitions.
// Phase 1: matrix 570 rows 620 cols
[2023-03-19 04:30:54] [INFO ] Computed 111 place invariants in 19 ms
[2023-03-19 04:30:54] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-19 04:30:54] [INFO ] Invariant cache hit.
[2023-03-19 04:30:55] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
[2023-03-19 04:30:55] [INFO ] Invariant cache hit.
[2023-03-19 04:30:56] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 620/683 places, 570/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2285 ms. Remains : 620/683 places, 570/633 transitions.
Support contains 34 out of 620 places after structural reductions.
[2023-03-19 04:30:56] [INFO ] Flatten gal took : 74 ms
[2023-03-19 04:30:56] [INFO ] Flatten gal took : 40 ms
[2023-03-19 04:30:56] [INFO ] Input system was already deterministic with 570 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 04:30:57] [INFO ] Invariant cache hit.
[2023-03-19 04:30:57] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:30:57] [INFO ] [Nat]Absence check using 111 positive place invariants in 33 ms returned sat
[2023-03-19 04:30:57] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 04:30:58] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 4 ms to minimize.
[2023-03-19 04:30:58] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 2 ms to minimize.
[2023-03-19 04:30:58] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 4 ms to minimize.
[2023-03-19 04:30:59] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 1 ms to minimize.
[2023-03-19 04:30:59] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 12 ms to minimize.
[2023-03-19 04:30:59] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2023-03-19 04:30:59] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2023-03-19 04:30:59] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 1 ms to minimize.
[2023-03-19 04:31:00] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2023-03-19 04:31:00] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2023-03-19 04:31:00] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2023-03-19 04:31:00] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2023-03-19 04:31:00] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2023-03-19 04:31:01] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 0 ms to minimize.
[2023-03-19 04:31:01] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2023-03-19 04:31:01] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-19 04:31:01] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2023-03-19 04:31:01] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 2 ms to minimize.
[2023-03-19 04:31:01] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2023-03-19 04:31:02] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-19 04:31:02] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2023-03-19 04:31:02] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2023-03-19 04:31:02] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 1 ms to minimize.
[2023-03-19 04:31:02] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 0 ms to minimize.
[2023-03-19 04:31:02] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2023-03-19 04:31:03] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2023-03-19 04:31:03] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 1 ms to minimize.
[2023-03-19 04:31:03] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2023-03-19 04:31:03] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2023-03-19 04:31:03] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2023-03-19 04:31:03] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2023-03-19 04:31:03] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6050 ms
[2023-03-19 04:31:04] [INFO ] After 6491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 04:31:04] [INFO ] After 6686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 570/570 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 620 transition count 498
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 548 transition count 498
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 144 place count 548 transition count 449
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 242 place count 499 transition count 449
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 248 place count 493 transition count 443
Iterating global reduction 2 with 6 rules applied. Total rules applied 254 place count 493 transition count 443
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 254 place count 493 transition count 440
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 260 place count 490 transition count 440
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 608 place count 316 transition count 266
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 2 with 87 rules applied. Total rules applied 695 place count 316 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 315 transition count 265
Applied a total of 696 rules in 205 ms. Remains 315 /620 variables (removed 305) and now considering 265/570 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 315/620 places, 265/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608916 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608916 steps, saw 461492 distinct states, run finished after 3002 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 315 cols
[2023-03-19 04:31:07] [INFO ] Computed 111 place invariants in 14 ms
[2023-03-19 04:31:07] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:31:07] [INFO ] [Nat]Absence check using 106 positive place invariants in 22 ms returned sat
[2023-03-19 04:31:07] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-19 04:31:07] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 04:31:07] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 3 ms to minimize.
[2023-03-19 04:31:08] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 34 ms to minimize.
[2023-03-19 04:31:08] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-19 04:31:08] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-19 04:31:08] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2023-03-19 04:31:08] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 2 ms to minimize.
[2023-03-19 04:31:08] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2023-03-19 04:31:08] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 5 ms to minimize.
[2023-03-19 04:31:08] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-19 04:31:09] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-19 04:31:09] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2023-03-19 04:31:09] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2023-03-19 04:31:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1484 ms
[2023-03-19 04:31:09] [INFO ] After 1642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 04:31:09] [INFO ] After 1831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 265/265 transitions.
Applied a total of 0 rules in 24 ms. Remains 315 /315 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 315/315 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 265/265 transitions.
Applied a total of 0 rules in 18 ms. Remains 315 /315 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2023-03-19 04:31:09] [INFO ] Invariant cache hit.
[2023-03-19 04:31:09] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-19 04:31:09] [INFO ] Invariant cache hit.
[2023-03-19 04:31:10] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2023-03-19 04:31:10] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 04:31:10] [INFO ] Invariant cache hit.
[2023-03-19 04:31:10] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1262 ms. Remains : 315/315 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 315 /315 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 04:31:10] [INFO ] Invariant cache hit.
[2023-03-19 04:31:10] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:31:10] [INFO ] [Nat]Absence check using 106 positive place invariants in 19 ms returned sat
[2023-03-19 04:31:10] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 0 ms returned sat
[2023-03-19 04:31:11] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 04:31:11] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2023-03-19 04:31:11] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-19 04:31:11] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-19 04:31:11] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-19 04:31:11] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2023-03-19 04:31:11] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-19 04:31:12] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2023-03-19 04:31:12] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2023-03-19 04:31:12] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-19 04:31:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1160 ms
[2023-03-19 04:31:12] [INFO ] After 1410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-19 04:31:12] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldPPPs-PT-010B-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 125 stabilizing places and 125 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 619 transition count 498
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 548 transition count 498
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 142 place count 548 transition count 449
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 240 place count 499 transition count 449
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 491 transition count 441
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 256 place count 491 transition count 437
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 264 place count 487 transition count 437
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 1 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 610 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 612 place count 312 transition count 262
Applied a total of 612 rules in 80 ms. Remains 312 /620 variables (removed 308) and now considering 262/570 (removed 308) transitions.
// Phase 1: matrix 262 rows 312 cols
[2023-03-19 04:31:12] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-19 04:31:13] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-19 04:31:13] [INFO ] Invariant cache hit.
[2023-03-19 04:31:13] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-19 04:31:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 04:31:13] [INFO ] Invariant cache hit.
[2023-03-19 04:31:13] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/620 places, 262/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 636 ms. Remains : 312/620 places, 262/570 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s177 0) (EQ s307 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 137 reset in 508 ms.
Product exploration explored 100000 steps with 136 reset in 626 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 284 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-19 04:31:15] [INFO ] Invariant cache hit.
[2023-03-19 04:31:15] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-19 04:31:15] [INFO ] Invariant cache hit.
[2023-03-19 04:31:15] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2023-03-19 04:31:15] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 04:31:15] [INFO ] Invariant cache hit.
[2023-03-19 04:31:16] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 869 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 466 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=22 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Product exploration explored 100000 steps with 137 reset in 475 ms.
Product exploration explored 100000 steps with 138 reset in 510 ms.
Built C files in :
/tmp/ltsmin11952183603787276625
[2023-03-19 04:31:17] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2023-03-19 04:31:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:31:17] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2023-03-19 04:31:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:31:18] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2023-03-19 04:31:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:31:18] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11952183603787276625
Running compilation step : cd /tmp/ltsmin11952183603787276625;'/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 802 ms.
Running link step : cd /tmp/ltsmin11952183603787276625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin11952183603787276625;'/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/stateBased671500767748791214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-19 04:31:33] [INFO ] Invariant cache hit.
[2023-03-19 04:31:33] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-19 04:31:33] [INFO ] Invariant cache hit.
[2023-03-19 04:31:33] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-19 04:31:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 04:31:33] [INFO ] Invariant cache hit.
[2023-03-19 04:31:33] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 782 ms. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin7765199446673608154
[2023-03-19 04:31:33] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2023-03-19 04:31:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:31:33] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2023-03-19 04:31:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:31:33] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2023-03-19 04:31:33] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:31:33] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7765199446673608154
Running compilation step : cd /tmp/ltsmin7765199446673608154;'/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 545 ms.
Running link step : cd /tmp/ltsmin7765199446673608154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin7765199446673608154;'/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/stateBased9916192002852331695.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 04:31:49] [INFO ] Flatten gal took : 21 ms
[2023-03-19 04:31:49] [INFO ] Flatten gal took : 17 ms
[2023-03-19 04:31:49] [INFO ] Time to serialize gal into /tmp/LTL851409177000393419.gal : 4 ms
[2023-03-19 04:31:49] [INFO ] Time to serialize properties into /tmp/LTL13434998543148906906.prop : 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/LTL851409177000393419.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15544471127248494441.hoa' '-atoms' '/tmp/LTL13434998543148906906.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/LTL13434998543148906906.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15544471127248494441.hoa
Detected timeout of ITS tools.
[2023-03-19 04:32:04] [INFO ] Flatten gal took : 29 ms
[2023-03-19 04:32:04] [INFO ] Flatten gal took : 11 ms
[2023-03-19 04:32:04] [INFO ] Time to serialize gal into /tmp/LTL3716701665023941332.gal : 3 ms
[2023-03-19 04:32:04] [INFO ] Time to serialize properties into /tmp/LTL1731816871666203873.ltl : 10 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/LTL3716701665023941332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1731816871666203873.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 : !((F(G("((p386==0)||(p670==1))"))))
Formula 0 simplified : GF!"((p386==0)||(p670==1))"
Detected timeout of ITS tools.
[2023-03-19 04:32:19] [INFO ] Flatten gal took : 37 ms
[2023-03-19 04:32:19] [INFO ] Applying decomposition
[2023-03-19 04:32:19] [INFO ] Flatten gal took : 15 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/graph5953982819397628020.txt' '-o' '/tmp/graph5953982819397628020.bin' '-w' '/tmp/graph5953982819397628020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5953982819397628020.bin' '-l' '-1' '-v' '-w' '/tmp/graph5953982819397628020.weights' '-q' '0' '-e' '0.001'
[2023-03-19 04:32:19] [INFO ] Decomposing Gal with order
[2023-03-19 04:32:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:32:19] [INFO ] Removed a total of 61 redundant transitions.
[2023-03-19 04:32:19] [INFO ] Flatten gal took : 49 ms
[2023-03-19 04:32:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 7 ms.
[2023-03-19 04:32:19] [INFO ] Time to serialize gal into /tmp/LTL14942717021778930847.gal : 6 ms
[2023-03-19 04:32:19] [INFO ] Time to serialize properties into /tmp/LTL13694206256921594293.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/LTL14942717021778930847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13694206256921594293.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.i0.u63.p386==0)||(i9.i1.u109.p670==1))"))))
Formula 0 simplified : GF!"((i5.i0.u63.p386==0)||(i9.i1.u109.p670==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12602855077326082262
[2023-03-19 04:32:34] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12602855077326082262
Running compilation step : cd /tmp/ltsmin12602855077326082262;'/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 403 ms.
Running link step : cd /tmp/ltsmin12602855077326082262;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12602855077326082262;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-01 finished in 97104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(X(p0)) U p1)))'
Support contains 3 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 612 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 612 transition count 562
Applied a total of 16 rules in 39 ms. Remains 612 /620 variables (removed 8) and now considering 562/570 (removed 8) transitions.
// Phase 1: matrix 562 rows 612 cols
[2023-03-19 04:32:49] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-19 04:32:50] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-19 04:32:50] [INFO ] Invariant cache hit.
[2023-03-19 04:32:50] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2023-03-19 04:32:50] [INFO ] Invariant cache hit.
[2023-03-19 04:32:51] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/620 places, 562/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1319 ms. Remains : 612/620 places, 562/570 transitions.
Stuttering acceptance computed with spot in 477 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s219 1), p1:(OR (EQ s126 0) (EQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 567 ms.
Product exploration explored 100000 steps with 50000 reset in 500 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-02 finished in 3042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(p1 U X(p2))))'
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 564
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 564
Applied a total of 12 rules in 15 ms. Remains 614 /620 variables (removed 6) and now considering 564/570 (removed 6) transitions.
// Phase 1: matrix 564 rows 614 cols
[2023-03-19 04:32:52] [INFO ] Computed 111 place invariants in 7 ms
[2023-03-19 04:32:53] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-19 04:32:53] [INFO ] Invariant cache hit.
[2023-03-19 04:32:53] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2023-03-19 04:32:53] [INFO ] Invariant cache hit.
[2023-03-19 04:32:54] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/620 places, 564/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1237 ms. Remains : 614/620 places, 564/570 transitions.
Stuttering acceptance computed with spot in 356 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}]], initial=1, aps=[p1:(OR (EQ s378 0) (EQ s117 1)), p0:(EQ s384 1), p2:(EQ s605 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-03 finished in 1613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 613 transition count 563
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 613 transition count 563
Applied a total of 14 rules in 17 ms. Remains 613 /620 variables (removed 7) and now considering 563/570 (removed 7) transitions.
// Phase 1: matrix 563 rows 613 cols
[2023-03-19 04:32:54] [INFO ] Computed 111 place invariants in 6 ms
[2023-03-19 04:32:54] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-19 04:32:54] [INFO ] Invariant cache hit.
[2023-03-19 04:32:55] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2023-03-19 04:32:55] [INFO ] Invariant cache hit.
[2023-03-19 04:32:55] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/620 places, 563/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1412 ms. Remains : 613/620 places, 563/570 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s555 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-05 finished in 1596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 612 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 612 transition count 562
Applied a total of 16 rules in 16 ms. Remains 612 /620 variables (removed 8) and now considering 562/570 (removed 8) transitions.
// Phase 1: matrix 562 rows 612 cols
[2023-03-19 04:32:56] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-19 04:32:56] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-19 04:32:56] [INFO ] Invariant cache hit.
[2023-03-19 04:32:57] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2023-03-19 04:32:57] [INFO ] Invariant cache hit.
[2023-03-19 04:32:57] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/620 places, 562/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1349 ms. Remains : 612/620 places, 562/570 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s440 0) (EQ s343 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-06 finished in 1557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&p1))))'
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 613 transition count 563
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 613 transition count 563
Applied a total of 14 rules in 32 ms. Remains 613 /620 variables (removed 7) and now considering 563/570 (removed 7) transitions.
// Phase 1: matrix 563 rows 613 cols
[2023-03-19 04:32:57] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-19 04:32:58] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-19 04:32:58] [INFO ] Invariant cache hit.
[2023-03-19 04:32:58] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-19 04:32:58] [INFO ] Invariant cache hit.
[2023-03-19 04:32:58] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/620 places, 563/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1269 ms. Remains : 613/620 places, 563/570 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s510 1)), p1:(AND (EQ s594 0) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 397 reset in 312 ms.
Product exploration explored 100000 steps with 395 reset in 338 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 300 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 279 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 121 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2023-03-19 04:33:00] [INFO ] Invariant cache hit.
[2023-03-19 04:33:01] [INFO ] [Real]Absence check using 111 positive place invariants in 48 ms returned sat
[2023-03-19 04:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:33:02] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2023-03-19 04:33:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:33:02] [INFO ] [Nat]Absence check using 111 positive place invariants in 62 ms returned sat
[2023-03-19 04:33:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:33:03] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2023-03-19 04:33:03] [INFO ] Computed and/alt/rep : 562/993/562 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-19 04:33:15] [INFO ] Added : 557 causal constraints over 116 iterations in 11172 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 613 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 490
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 490
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 540 transition count 440
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 490 transition count 440
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 594 place count 315 transition count 265
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 313 transition count 263
Applied a total of 596 rules in 78 ms. Remains 313 /613 variables (removed 300) and now considering 263/563 (removed 300) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-19 04:33:15] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-19 04:33:15] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-19 04:33:15] [INFO ] Invariant cache hit.
[2023-03-19 04:33:15] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-19 04:33:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 04:33:15] [INFO ] Invariant cache hit.
[2023-03-19 04:33:15] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 313/613 places, 263/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 313/613 places, 263/563 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 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 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 159 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 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
[2023-03-19 04:33:16] [INFO ] Invariant cache hit.
[2023-03-19 04:33:16] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2023-03-19 04:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:33:16] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-19 04:33:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:33:17] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2023-03-19 04:33:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:33:17] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2023-03-19 04:33:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2023-03-19 04:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-19 04:33:17] [INFO ] Computed and/alt/rep : 261/496/261 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-19 04:33:19] [INFO ] Added : 215 causal constraints over 43 iterations in 1641 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2087 reset in 314 ms.
Product exploration explored 100000 steps with 2126 reset in 367 ms.
Built C files in :
/tmp/ltsmin10603035174134412398
[2023-03-19 04:33:19] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2023-03-19 04:33:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:19] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2023-03-19 04:33:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:19] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2023-03-19 04:33:19] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:19] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10603035174134412398
Running compilation step : cd /tmp/ltsmin10603035174134412398;'/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 547 ms.
Running link step : cd /tmp/ltsmin10603035174134412398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10603035174134412398;'/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/stateBased12172529392885593902.hoa' '--buchi-type=spotba'
LTSmin run took 1110 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-07 finished in 23997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 564
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 564
Applied a total of 12 rules in 17 ms. Remains 614 /620 variables (removed 6) and now considering 564/570 (removed 6) transitions.
// Phase 1: matrix 564 rows 614 cols
[2023-03-19 04:33:21] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-19 04:33:22] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-19 04:33:22] [INFO ] Invariant cache hit.
[2023-03-19 04:33:23] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2023-03-19 04:33:23] [INFO ] Invariant cache hit.
[2023-03-19 04:33:23] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/620 places, 564/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1772 ms. Remains : 614/620 places, 564/570 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s258 0) (EQ s356 1) (EQ s177 0) (EQ s601 1)), p1:(AND (EQ s356 0) (EQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1513 steps with 0 reset in 16 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-08 finished in 1929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 612 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 612 transition count 562
Applied a total of 16 rules in 34 ms. Remains 612 /620 variables (removed 8) and now considering 562/570 (removed 8) transitions.
// Phase 1: matrix 562 rows 612 cols
[2023-03-19 04:33:23] [INFO ] Computed 111 place invariants in 5 ms
[2023-03-19 04:33:23] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-19 04:33:23] [INFO ] Invariant cache hit.
[2023-03-19 04:33:24] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2023-03-19 04:33:24] [INFO ] Invariant cache hit.
[2023-03-19 04:33:24] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/620 places, 562/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1301 ms. Remains : 612/620 places, 562/570 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s444 0) (EQ s532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 362 ms.
Product exploration explored 100000 steps with 33333 reset in 332 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-09 finished in 2248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 613 transition count 563
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 613 transition count 563
Applied a total of 14 rules in 35 ms. Remains 613 /620 variables (removed 7) and now considering 563/570 (removed 7) transitions.
// Phase 1: matrix 563 rows 613 cols
[2023-03-19 04:33:25] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-19 04:33:26] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-19 04:33:26] [INFO ] Invariant cache hit.
[2023-03-19 04:33:26] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2023-03-19 04:33:26] [INFO ] Invariant cache hit.
[2023-03-19 04:33:27] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/620 places, 563/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1384 ms. Remains : 613/620 places, 563/570 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s45 0) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-11 finished in 1498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 619 transition count 497
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 547 transition count 497
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 547 transition count 447
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 497 transition count 447
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 252 place count 489 transition count 439
Iterating global reduction 2 with 8 rules applied. Total rules applied 260 place count 489 transition count 439
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 260 place count 489 transition count 435
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 268 place count 485 transition count 435
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 612 place count 313 transition count 263
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 614 place count 311 transition count 261
Applied a total of 614 rules in 72 ms. Remains 311 /620 variables (removed 309) and now considering 261/570 (removed 309) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-19 04:33:27] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-19 04:33:27] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-19 04:33:27] [INFO ] Invariant cache hit.
[2023-03-19 04:33:27] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-19 04:33:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 04:33:27] [INFO ] Invariant cache hit.
[2023-03-19 04:33:28] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/620 places, 261/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 773 ms. Remains : 311/620 places, 261/570 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 140 reset in 472 ms.
Product exploration explored 100000 steps with 141 reset in 431 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 165 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=55 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-19 04:33:29] [INFO ] Invariant cache hit.
[2023-03-19 04:33:30] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-19 04:33:30] [INFO ] Invariant cache hit.
[2023-03-19 04:33:30] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-19 04:33:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 04:33:30] [INFO ] Invariant cache hit.
[2023-03-19 04:33:30] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 867 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Finished random walk after 154 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=77 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Product exploration explored 100000 steps with 139 reset in 413 ms.
Product exploration explored 100000 steps with 141 reset in 423 ms.
Built C files in :
/tmp/ltsmin8775838727998870934
[2023-03-19 04:33:32] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2023-03-19 04:33:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:32] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2023-03-19 04:33:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:32] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2023-03-19 04:33:32] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:32] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8775838727998870934
Running compilation step : cd /tmp/ltsmin8775838727998870934;'/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 542 ms.
Running link step : cd /tmp/ltsmin8775838727998870934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin8775838727998870934;'/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/stateBased12938167769598835998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 21 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-19 04:33:47] [INFO ] Invariant cache hit.
[2023-03-19 04:33:47] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-19 04:33:47] [INFO ] Invariant cache hit.
[2023-03-19 04:33:47] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2023-03-19 04:33:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 04:33:47] [INFO ] Invariant cache hit.
[2023-03-19 04:33:48] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 986 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin18199675744023936032
[2023-03-19 04:33:48] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2023-03-19 04:33:48] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:48] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2023-03-19 04:33:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:48] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2023-03-19 04:33:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:33:48] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18199675744023936032
Running compilation step : cd /tmp/ltsmin18199675744023936032;'/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 552 ms.
Running link step : cd /tmp/ltsmin18199675744023936032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18199675744023936032;'/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/stateBased1491273101040680698.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 04:34:03] [INFO ] Flatten gal took : 15 ms
[2023-03-19 04:34:03] [INFO ] Flatten gal took : 11 ms
[2023-03-19 04:34:03] [INFO ] Time to serialize gal into /tmp/LTL1267973135129008256.gal : 2 ms
[2023-03-19 04:34:03] [INFO ] Time to serialize properties into /tmp/LTL4853386968309886405.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/LTL1267973135129008256.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14650540270048318461.hoa' '-atoms' '/tmp/LTL4853386968309886405.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/LTL4853386968309886405.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14650540270048318461.hoa
Detected timeout of ITS tools.
[2023-03-19 04:34:18] [INFO ] Flatten gal took : 28 ms
[2023-03-19 04:34:18] [INFO ] Flatten gal took : 24 ms
[2023-03-19 04:34:18] [INFO ] Time to serialize gal into /tmp/LTL10737929292004320698.gal : 2 ms
[2023-03-19 04:34:18] [INFO ] Time to serialize properties into /tmp/LTL1512120275667042374.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/LTL10737929292004320698.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1512120275667042374.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p241!=1)"))))
Formula 0 simplified : GF!"(p241!=1)"
Detected timeout of ITS tools.
[2023-03-19 04:34:33] [INFO ] Flatten gal took : 30 ms
[2023-03-19 04:34:33] [INFO ] Applying decomposition
[2023-03-19 04:34:33] [INFO ] Flatten gal took : 19 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/graph4650584545691537036.txt' '-o' '/tmp/graph4650584545691537036.bin' '-w' '/tmp/graph4650584545691537036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4650584545691537036.bin' '-l' '-1' '-v' '-w' '/tmp/graph4650584545691537036.weights' '-q' '0' '-e' '0.001'
[2023-03-19 04:34:33] [INFO ] Decomposing Gal with order
[2023-03-19 04:34:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:34:33] [INFO ] Removed a total of 62 redundant transitions.
[2023-03-19 04:34:33] [INFO ] Flatten gal took : 22 ms
[2023-03-19 04:34:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 6 ms.
[2023-03-19 04:34:33] [INFO ] Time to serialize gal into /tmp/LTL10608242710728530719.gal : 4 ms
[2023-03-19 04:34:33] [INFO ] Time to serialize properties into /tmp/LTL15838914628929057306.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/LTL10608242710728530719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15838914628929057306.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i3.i1.i1.u40.p241!=1)"))))
Formula 0 simplified : GF!"(i3.i1.i1.u40.p241!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15796279559872606749
[2023-03-19 04:34:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15796279559872606749
Running compilation step : cd /tmp/ltsmin15796279559872606749;'/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 453 ms.
Running link step : cd /tmp/ltsmin15796279559872606749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15796279559872606749;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 6327 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-12 finished in 88315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 5 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 570/570 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 619 transition count 501
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 551 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 550 transition count 500
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 138 place count 550 transition count 449
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 240 place count 499 transition count 449
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 248 place count 491 transition count 441
Iterating global reduction 3 with 8 rules applied. Total rules applied 256 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 256 place count 491 transition count 437
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 264 place count 487 transition count 437
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 602 place count 318 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 317 transition count 267
Applied a total of 603 rules in 112 ms. Remains 317 /620 variables (removed 303) and now considering 267/570 (removed 303) transitions.
// Phase 1: matrix 267 rows 317 cols
[2023-03-19 04:34:55] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-19 04:34:56] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-19 04:34:56] [INFO ] Invariant cache hit.
[2023-03-19 04:34:56] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2023-03-19 04:34:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 04:34:56] [INFO ] Invariant cache hit.
[2023-03-19 04:34:56] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 317/620 places, 267/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1040 ms. Remains : 317/620 places, 267/570 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s222 0) (EQ s139 1)), p1:(EQ s1 1), p2:(OR (EQ s306 0) (EQ s257 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 134 reset in 483 ms.
Product exploration explored 100000 steps with 137 reset in 551 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/317 stabilizing places and 4/267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 994 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 04:34:59] [INFO ] Invariant cache hit.
[2023-03-19 04:34:59] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:34:59] [INFO ] [Nat]Absence check using 111 positive place invariants in 19 ms returned sat
[2023-03-19 04:34:59] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 1139 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2))]
Support contains 4 out of 317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 267/267 transitions.
Applied a total of 0 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2023-03-19 04:35:00] [INFO ] Invariant cache hit.
[2023-03-19 04:35:01] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-19 04:35:01] [INFO ] Invariant cache hit.
[2023-03-19 04:35:01] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-19 04:35:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 04:35:01] [INFO ] Invariant cache hit.
[2023-03-19 04:35:01] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 796 ms. Remains : 317/317 places, 267/267 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 452 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 150 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 657 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 137 reset in 485 ms.
Product exploration explored 100000 steps with 137 reset in 442 ms.
Built C files in :
/tmp/ltsmin1545833658311764267
[2023-03-19 04:35:03] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2023-03-19 04:35:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:35:03] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2023-03-19 04:35:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:35:03] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2023-03-19 04:35:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:35:03] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1545833658311764267
Running compilation step : cd /tmp/ltsmin1545833658311764267;'/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 535 ms.
Running link step : cd /tmp/ltsmin1545833658311764267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin1545833658311764267;'/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/stateBased2873042416533206514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 265
Applied a total of 1 rules in 24 ms. Remains 315 /317 variables (removed 2) and now considering 265/267 (removed 2) transitions.
// Phase 1: matrix 265 rows 315 cols
[2023-03-19 04:35:19] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-19 04:35:19] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-19 04:35:19] [INFO ] Invariant cache hit.
[2023-03-19 04:35:19] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-19 04:35:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 04:35:19] [INFO ] Invariant cache hit.
[2023-03-19 04:35:19] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/317 places, 265/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 911 ms. Remains : 315/317 places, 265/267 transitions.
Built C files in :
/tmp/ltsmin4929460756988900685
[2023-03-19 04:35:19] [INFO ] Computing symmetric may disable matrix : 265 transitions.
[2023-03-19 04:35:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:35:19] [INFO ] Computing symmetric may enable matrix : 265 transitions.
[2023-03-19 04:35:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:35:19] [INFO ] Computing Do-Not-Accords matrix : 265 transitions.
[2023-03-19 04:35:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:35:19] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4929460756988900685
Running compilation step : cd /tmp/ltsmin4929460756988900685;'/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 566 ms.
Running link step : cd /tmp/ltsmin4929460756988900685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4929460756988900685;'/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/stateBased1442079646316619185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 04:35:35] [INFO ] Flatten gal took : 13 ms
[2023-03-19 04:35:35] [INFO ] Flatten gal took : 11 ms
[2023-03-19 04:35:35] [INFO ] Time to serialize gal into /tmp/LTL8889780853251457384.gal : 3 ms
[2023-03-19 04:35:35] [INFO ] Time to serialize properties into /tmp/LTL14367466485046491267.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/LTL8889780853251457384.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9575687478720670109.hoa' '-atoms' '/tmp/LTL14367466485046491267.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/LTL14367466485046491267.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9575687478720670109.hoa
Detected timeout of ITS tools.
[2023-03-19 04:35:50] [INFO ] Flatten gal took : 27 ms
[2023-03-19 04:35:50] [INFO ] Flatten gal took : 23 ms
[2023-03-19 04:35:50] [INFO ] Time to serialize gal into /tmp/LTL15084711015476058040.gal : 4 ms
[2023-03-19 04:35:50] [INFO ] Time to serialize properties into /tmp/LTL5801113549591430476.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/LTL15084711015476058040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5801113549591430476.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...276
Read 1 LTL properties
Checking formula 0 : !((F(((G("((p490==0)||(p305==1))"))||(G("(p2==1)")))||(G("((p656==0)||(p560==1))")))))
Formula 0 simplified : G(F!"((p490==0)||(p305==1))" & F!"(p2==1)" & F!"((p656==0)||(p560==1))")
Detected timeout of ITS tools.
[2023-03-19 04:36:05] [INFO ] Flatten gal took : 30 ms
[2023-03-19 04:36:05] [INFO ] Applying decomposition
[2023-03-19 04:36:05] [INFO ] Flatten gal took : 23 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/graph8558680916139147533.txt' '-o' '/tmp/graph8558680916139147533.bin' '-w' '/tmp/graph8558680916139147533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8558680916139147533.bin' '-l' '-1' '-v' '-w' '/tmp/graph8558680916139147533.weights' '-q' '0' '-e' '0.001'
[2023-03-19 04:36:05] [INFO ] Decomposing Gal with order
[2023-03-19 04:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:36:05] [INFO ] Removed a total of 61 redundant transitions.
[2023-03-19 04:36:05] [INFO ] Flatten gal took : 40 ms
[2023-03-19 04:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 22 ms.
[2023-03-19 04:36:05] [INFO ] Time to serialize gal into /tmp/LTL13249615618348489029.gal : 6 ms
[2023-03-19 04:36:05] [INFO ] Time to serialize properties into /tmp/LTL12656293526341355309.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/LTL13249615618348489029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12656293526341355309.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...256
Read 1 LTL properties
Checking formula 0 : !((F(((G("((i7.i2.u78.p490==0)||(i4.i3.u49.p305==1))"))||(G("(i8.i0.u97.p2==1)")))||(G("((i9.i0.u108.p656==0)||(i8.i2.u91.p560==1))"))...158
Formula 0 simplified : G(F!"((i7.i2.u78.p490==0)||(i4.i3.u49.p305==1))" & F!"(i8.i0.u97.p2==1)" & F!"((i9.i0.u108.p656==0)||(i8.i2.u91.p560==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14380556671898512258
[2023-03-19 04:36:20] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14380556671898512258
Running compilation step : cd /tmp/ltsmin14380556671898512258;'/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 484 ms.
Running link step : cd /tmp/ltsmin14380556671898512258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin14380556671898512258;'/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' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 5114 ms.
FORMULA ShieldPPPs-PT-010B-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010B-LTLCardinality-13 finished in 90529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-19 04:36:26] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14664095332285739647
[2023-03-19 04:36:26] [INFO ] Computing symmetric may disable matrix : 570 transitions.
[2023-03-19 04:36:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:36:26] [INFO ] Computing symmetric may enable matrix : 570 transitions.
[2023-03-19 04:36:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:36:26] [INFO ] Applying decomposition
[2023-03-19 04:36:26] [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/graph16078652772770758673.txt' '-o' '/tmp/graph16078652772770758673.bin' '-w' '/tmp/graph16078652772770758673.weights'
[2023-03-19 04:36:26] [INFO ] Computing Do-Not-Accords matrix : 570 transitions.
[2023-03-19 04:36:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16078652772770758673.bin' '-l' '-1' '-v' '-w' '/tmp/graph16078652772770758673.weights' '-q' '0' '-e' '0.001'
[2023-03-19 04:36:26] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14664095332285739647
Running compilation step : cd /tmp/ltsmin14664095332285739647;'/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 04:36:26] [INFO ] Decomposing Gal with order
[2023-03-19 04:36:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:36:26] [INFO ] Removed a total of 90 redundant transitions.
[2023-03-19 04:36:26] [INFO ] Flatten gal took : 27 ms
[2023-03-19 04:36:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-19 04:36:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality14339919622312163871.gal : 5 ms
[2023-03-19 04:36:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality2837276050033250193.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/LTLCardinality14339919622312163871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2837276050033250193.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 : !((F(G("((i5.i2.i1.u138.p386==0)||(i10.i1.i1.u238.p670==1))"))))
Formula 0 simplified : GF!"((i5.i2.i1.u138.p386==0)||(i10.i1.i1.u238.p670==1))"
Compilation finished in 1314 ms.
Running link step : cd /tmp/ltsmin14664095332285739647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin14664095332285739647;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 04:58:17] [INFO ] Applying decomposition
[2023-03-19 04:58:17] [INFO ] Flatten gal took : 32 ms
[2023-03-19 04:58:17] [INFO ] Decomposing Gal with order
[2023-03-19 04:58:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:58:17] [INFO ] Removed a total of 60 redundant transitions.
[2023-03-19 04:58:17] [INFO ] Flatten gal took : 89 ms
[2023-03-19 04:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 33 ms.
[2023-03-19 04:58:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality9323304488557206503.gal : 5 ms
[2023-03-19 04:58:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality3919266451958416827.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/LTLCardinality9323304488557206503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3919266451958416827.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i0.i0.i1.i0.i0.i0.u133.p386==0)||(i1.i0.u219.p670==1))"))))
Formula 0 simplified : GF!"((i0.i0.i0.i0.i1.i0.i0.i0.u133.p386==0)||(i1.i0.u219.p670==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.065: Initializing POR dependencies: labels 571, guards 570
pins2lts-mc-linux64( 6/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 5.161: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 5.162: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 5.162: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 5.597: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 5.613: There are 572 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 5.613: State length is 621, there are 574 groups
pins2lts-mc-linux64( 0/ 8), 5.613: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 5.613: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 5.613: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 5.613: Visible groups: 0 / 574, labels: 1 / 572
pins2lts-mc-linux64( 0/ 8), 5.613: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 5.613: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 5.631: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 2/ 8), 5.651: [Blue] ~240 levels ~1920 states ~2136 transitions
pins2lts-mc-linux64( 2/ 8), 5.770: [Blue] ~480 levels ~3840 states ~7608 transitions
pins2lts-mc-linux64( 2/ 8), 6.053: [Blue] ~960 levels ~7680 states ~22064 transitions
pins2lts-mc-linux64( 4/ 8), 6.392: [Blue] ~1522 levels ~15360 states ~42872 transitions
pins2lts-mc-linux64( 0/ 8), 6.786: [Blue] ~1674 levels ~30720 states ~62992 transitions
pins2lts-mc-linux64( 4/ 8), 7.496: [Blue] ~1537 levels ~61440 states ~111304 transitions
pins2lts-mc-linux64( 1/ 8), 8.786: [Blue] ~2016 levels ~122880 states ~206848 transitions
pins2lts-mc-linux64( 1/ 8), 11.392: [Blue] ~2016 levels ~245760 states ~402688 transitions
pins2lts-mc-linux64( 7/ 8), 16.415: [Blue] ~1713 levels ~491520 states ~768752 transitions
pins2lts-mc-linux64( 7/ 8), 25.394: [Blue] ~1713 levels ~983040 states ~1474512 transitions
pins2lts-mc-linux64( 7/ 8), 43.529: [Blue] ~1713 levels ~1966080 states ~2953152 transitions
pins2lts-mc-linux64( 1/ 8), 78.783: [Blue] ~2083 levels ~3932160 states ~6084984 transitions
pins2lts-mc-linux64( 1/ 8), 150.298: [Blue] ~2083 levels ~7864320 states ~12308256 transitions
pins2lts-mc-linux64( 1/ 8), 294.490: [Blue] ~2083 levels ~15728640 states ~26026896 transitions
pins2lts-mc-linux64( 1/ 8), 577.762: [Blue] ~2120 levels ~31457280 states ~49345856 transitions
pins2lts-mc-linux64( 1/ 8), 1147.197: [Blue] ~2120 levels ~62914560 states ~96058504 transitions
pins2lts-mc-linux64( 5/ 8), 1959.441: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1959.477:
pins2lts-mc-linux64( 0/ 8), 1959.477: Explored 88843888 states 148740694 transitions, fanout: 1.674
pins2lts-mc-linux64( 0/ 8), 1959.477: Total exploration time 1953.830 sec (1953.780 sec minimum, 1953.805 sec on average)
pins2lts-mc-linux64( 0/ 8), 1959.477: States per second: 45472, Transitions per second: 76128
pins2lts-mc-linux64( 0/ 8), 1959.477:
pins2lts-mc-linux64( 0/ 8), 1959.477: State space has 88868456 states, 12727470 are accepting
pins2lts-mc-linux64( 0/ 8), 1959.477: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1959.477: blue states: 88843888 (99.97%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1959.477: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1959.477: all-red states: 12734825 (14.33%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1959.477:
pins2lts-mc-linux64( 0/ 8), 1959.477: Total memory used for local state coloring: 0.2MB
pins2lts-mc-linux64( 0/ 8), 1959.477:
pins2lts-mc-linux64( 0/ 8), 1959.478: Queue width: 8B, total height: 14204, memory: 0.11MB
pins2lts-mc-linux64( 0/ 8), 1959.478: Tree memory: 934.0MB, 11.0 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1959.478: Tree fill ratio (roots/leafs): 66.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1959.478: Stored 770 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1959.478: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1959.478: Est. total memory use: 934.1MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14664095332285739647;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14664095332285739647;'/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' '--ltl' '<>([]((LTLAPp0==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 05:20:10] [INFO ] Flatten gal took : 325 ms
[2023-03-19 05:20:12] [INFO ] Input system was already deterministic with 570 transitions.
[2023-03-19 05:20:12] [INFO ] Transformed 620 places.
[2023-03-19 05:20:12] [INFO ] Transformed 570 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 05:20:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality12794667299860017736.gal : 9 ms
[2023-03-19 05:20:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality3806154907398997142.ltl : 3 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/LTLCardinality12794667299860017736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3806154907398997142.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p386==0)||(p670==1))"))))
Formula 0 simplified : GF!"((p386==0)||(p670==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5004068 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15991680 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-010B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713600443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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