Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789300432.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789300432
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 685K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716991598525

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 14:06:40] [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]
[2024-05-29 14:06:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:06:40] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-29 14:06:40] [INFO ] Transformed 2503 places.
[2024-05-29 14:06:40] [INFO ] Transformed 1803 transitions.
[2024-05-29 14:06:40] [INFO ] Found NUPN structural information;
[2024-05-29 14:06:40] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 238 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:06:41] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 14:06:42] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2024-05-29 14:06:42] [INFO ] Invariant cache hit.
[2024-05-29 14:06:44] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 3680 ms to find 0 implicit places.
[2024-05-29 14:06:44] [INFO ] Invariant cache hit.
[2024-05-29 14:06:46] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5180 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 26 out of 2503 places after structural reductions.
[2024-05-29 14:06:46] [INFO ] Flatten gal took : 275 ms
[2024-05-29 14:06:46] [INFO ] Flatten gal took : 186 ms
[2024-05-29 14:06:46] [INFO ] Input system was already deterministic with 1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-29 14:06:52] [INFO ] Invariant cache hit.
[2024-05-29 14:06:53] [INFO ] [Real]Absence check using 1101 positive place invariants in 255 ms returned sat
[2024-05-29 14:06:56] [INFO ] After 2106ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2024-05-29 14:06:56] [INFO ] After 2607ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:06:56] [INFO ] After 4082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:06:57] [INFO ] [Nat]Absence check using 1101 positive place invariants in 219 ms returned sat
[2024-05-29 14:07:08] [INFO ] After 10845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:07:12] [INFO ] After 14487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1943 ms.
[2024-05-29 14:07:14] [INFO ] After 17721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 1818 ms.
Support contains 18 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 391 times.
Drop transitions removed 391 transitions
Iterating global reduction 0 with 391 rules applied. Total rules applied 395 place count 2501 transition count 1800
Applied a total of 395 rules in 537 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 81135 steps, run timeout after 3011 ms. (steps per millisecond=26 ) properties seen :{0=1, 8=1}
Probabilistic random walk after 81135 steps, saw 78328 distinct states, run finished after 3012 ms. (steps per millisecond=26 ) properties seen :2
Running SMT prover for 7 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:07:21] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 14:07:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 231 ms returned sat
[2024-05-29 14:07:24] [INFO ] After 1699ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2024-05-29 14:07:24] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-29 14:07:24] [INFO ] After 132ms SMT Verify possible using 101 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 14:07:24] [INFO ] After 2999ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 14:07:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 217 ms returned sat
[2024-05-29 14:07:27] [INFO ] After 2039ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 14:07:37] [INFO ] After 10192ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 14:07:38] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2024-05-29 14:07:38] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 2 ms to minimize.
[2024-05-29 14:07:38] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 2 ms to minimize.
[2024-05-29 14:07:39] [INFO ] Deduced a trap composed of 8 places in 315 ms of which 1 ms to minimize.
[2024-05-29 14:07:40] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:07:40] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 2 ms to minimize.
[2024-05-29 14:07:40] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 1 ms to minimize.
[2024-05-29 14:07:41] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 0 ms to minimize.
[2024-05-29 14:07:41] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2024-05-29 14:07:42] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2024-05-29 14:07:42] [INFO ] Deduced a trap composed of 7 places in 299 ms of which 0 ms to minimize.
[2024-05-29 14:07:43] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2024-05-29 14:07:43] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2024-05-29 14:07:43] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 0 ms to minimize.
[2024-05-29 14:07:44] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2024-05-29 14:07:44] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 0 ms to minimize.
[2024-05-29 14:07:45] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2024-05-29 14:07:45] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 0 ms to minimize.
[2024-05-29 14:07:45] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2024-05-29 14:07:46] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2024-05-29 14:07:46] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
[2024-05-29 14:07:46] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 1 ms to minimize.
[2024-05-29 14:07:47] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:07:47] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
[2024-05-29 14:07:47] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2024-05-29 14:07:48] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:07:48] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 0 ms to minimize.
[2024-05-29 14:07:49] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 0 ms to minimize.
[2024-05-29 14:07:49] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 0 ms to minimize.
[2024-05-29 14:07:49] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 11618 ms
[2024-05-29 14:07:49] [INFO ] After 21878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 14:07:49] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 2 properties in 1123 ms.
Support contains 14 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2501 transition count 1800
Applied a total of 1 rules in 208 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 86523 steps, run timeout after 3007 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86523 steps, saw 83519 distinct states, run finished after 3008 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:07:54] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 14:07:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 225 ms returned sat
[2024-05-29 14:07:57] [INFO ] After 1642ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 14:07:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:07:57] [INFO ] After 139ms SMT Verify possible using 102 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:07:57] [INFO ] After 2796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:07:58] [INFO ] [Nat]Absence check using 1101 positive place invariants in 224 ms returned sat
[2024-05-29 14:08:00] [INFO ] After 2079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 14:08:02] [INFO ] After 1993ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 2 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2519 ms
[2024-05-29 14:08:06] [INFO ] After 6050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1777 ms.
[2024-05-29 14:08:08] [INFO ] After 10891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1008 ms.
Support contains 14 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 141 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 152 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:08:09] [INFO ] Invariant cache hit.
[2024-05-29 14:08:11] [INFO ] Implicit Places using invariants in 1490 ms returned []
[2024-05-29 14:08:11] [INFO ] Invariant cache hit.
[2024-05-29 14:08:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:08:13] [INFO ] Implicit Places using invariants and state equation in 2433 ms returned []
Implicit Place search using SMT with State Equation took 3924 ms to find 0 implicit places.
[2024-05-29 14:08:13] [INFO ] Redundant transitions in 233 ms returned []
[2024-05-29 14:08:13] [INFO ] Invariant cache hit.
[2024-05-29 14:08:15] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5532 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7265 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 103 place count 2498 transition count 1798
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 201 place count 2498 transition count 1700
Applied a total of 201 rules in 408 ms. Remains 2498 /2501 variables (removed 3) and now considering 1700/1800 (removed 100) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1700 rows 2498 cols
[2024-05-29 14:08:15] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-29 14:08:16] [INFO ] [Real]Absence check using 1100 positive place invariants in 227 ms returned sat
[2024-05-29 14:08:18] [INFO ] After 2674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 14:08:19] [INFO ] [Nat]Absence check using 1100 positive place invariants in 228 ms returned sat
[2024-05-29 14:08:22] [INFO ] After 3394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 14:08:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:08:24] [INFO ] After 1969ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 14:08:27] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:08:29] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:08:33] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:08:33] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:08:33] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-29 14:08:33] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:08:36] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 10 ms to minimize.
[2024-05-29 14:08:36] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2024-05-29 14:08:36] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:08:36] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:08:36] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2024-05-29 14:08:37] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:08:37] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:08:37] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:08:37] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10065 ms
[2024-05-29 14:08:39] [INFO ] After 16771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 5608 ms.
[2024-05-29 14:08:45] [INFO ] After 26765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 292 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:08:45] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 14:08:46] [INFO ] Implicit Places using invariants in 1462 ms returned []
[2024-05-29 14:08:46] [INFO ] Invariant cache hit.
[2024-05-29 14:08:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:08:51] [INFO ] Implicit Places using invariants and state equation in 4742 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6213 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 114 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2024-05-29 14:08:51] [INFO ] Computed 1100 invariants in 10 ms
[2024-05-29 14:08:53] [INFO ] Implicit Places using invariants in 1395 ms returned []
[2024-05-29 14:08:53] [INFO ] Invariant cache hit.
[2024-05-29 14:08:57] [INFO ] Implicit Places using invariants and state equation in 4045 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5444 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 185 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2024-05-29 14:08:57] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:08:58] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2024-05-29 14:08:58] [INFO ] Invariant cache hit.
[2024-05-29 14:09:00] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 3344 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 15594 ms. Remains : 2494/2503 places, 1796/1802 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 5855 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s2164 0) (EQ s727 1))) (NOT (OR (EQ s1967 0) (EQ s339 1)))), p0:(OR (EQ s1967 0) (EQ s339 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1707 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 2 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-00 finished in 23224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 1800
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2498 transition count 1798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 2497 transition count 1797
Applied a total of 9 rules in 253 ms. Remains 2497 /2503 variables (removed 6) and now considering 1797/1802 (removed 5) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2024-05-29 14:09:08] [INFO ] Computed 1100 invariants in 5 ms
[2024-05-29 14:09:10] [INFO ] Implicit Places using invariants in 1501 ms returned []
[2024-05-29 14:09:10] [INFO ] Invariant cache hit.
[2024-05-29 14:09:12] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 3363 ms to find 0 implicit places.
[2024-05-29 14:09:12] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 14:09:12] [INFO ] Invariant cache hit.
[2024-05-29 14:09:13] [INFO ] Dead Transitions using invariants and state equation in 1208 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/2503 places, 1797/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4871 ms. Remains : 2497/2503 places, 1797/1802 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2430 0) (EQ s1150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1541 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 85 in 2 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-01 finished in 6531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 70 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:09:15] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 14:09:16] [INFO ] Implicit Places using invariants in 1372 ms returned []
[2024-05-29 14:09:16] [INFO ] Invariant cache hit.
[2024-05-29 14:09:18] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 3271 ms to find 0 implicit places.
[2024-05-29 14:09:18] [INFO ] Invariant cache hit.
[2024-05-29 14:09:19] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4559 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1318 0) (EQ s290 1)), p0:(OR (EQ s381 0) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1591 ms.
Product exploration explored 100000 steps with 0 reset in 2004 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 94853 steps, run timeout after 3004 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94853 steps, saw 93905 distinct states, run finished after 3004 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 14:09:27] [INFO ] Invariant cache hit.
[2024-05-29 14:09:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 218 ms returned sat
[2024-05-29 14:09:29] [INFO ] After 1939ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:09:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 220 ms returned sat
[2024-05-29 14:09:32] [INFO ] After 2224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:09:32] [INFO ] After 2804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 371 ms.
[2024-05-29 14:09:33] [INFO ] After 4063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1325 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 251 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 85982 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85982 steps, saw 82185 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:09:38] [INFO ] Computed 1101 invariants in 16 ms
[2024-05-29 14:09:39] [INFO ] [Real]Absence check using 1101 positive place invariants in 235 ms returned sat
[2024-05-29 14:09:40] [INFO ] After 1987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:09:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 227 ms returned sat
[2024-05-29 14:09:44] [INFO ] After 2537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:09:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:09:48] [INFO ] After 3861ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:09:48] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:09:49] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 2 ms to minimize.
[2024-05-29 14:09:49] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 9 ms to minimize.
[2024-05-29 14:09:49] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 0 ms to minimize.
[2024-05-29 14:09:50] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:09:50] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 0 ms to minimize.
[2024-05-29 14:09:50] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:09:50] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2024-05-29 14:09:51] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:09:51] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2024-05-29 14:09:51] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 0 ms to minimize.
[2024-05-29 14:09:52] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:09:52] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2024-05-29 14:09:52] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2024-05-29 14:09:53] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2024-05-29 14:09:53] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2024-05-29 14:09:53] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 0 ms to minimize.
[2024-05-29 14:09:54] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 1 ms to minimize.
[2024-05-29 14:09:54] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:09:55] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:09:55] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:09:55] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:09:55] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2024-05-29 14:09:56] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:09:56] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:09:56] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:09:57] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:09:57] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 0 ms to minimize.
[2024-05-29 14:09:57] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2024-05-29 14:09:58] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:09:58] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:09:58] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 9966 ms
[2024-05-29 14:09:59] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:09:59] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:09:59] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:10:00] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:10:00] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:10:00] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:10:01] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2024-05-29 14:10:01] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2024-05-29 14:10:01] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:10:02] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 0 ms to minimize.
[2024-05-29 14:10:02] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2024-05-29 14:10:02] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2024-05-29 14:10:02] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4091 ms
[2024-05-29 14:10:05] [INFO ] After 21570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 14:10:05] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2375 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:10:08] [INFO ] Invariant cache hit.
[2024-05-29 14:10:09] [INFO ] Implicit Places using invariants in 1457 ms returned []
[2024-05-29 14:10:09] [INFO ] Invariant cache hit.
[2024-05-29 14:10:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:10:12] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
[2024-05-29 14:10:12] [INFO ] Redundant transitions in 118 ms returned []
[2024-05-29 14:10:12] [INFO ] Invariant cache hit.
[2024-05-29 14:10:13] [INFO ] Dead Transitions using invariants and state equation in 1223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5287 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 104 place count 2498 transition count 1798
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 203 place count 2498 transition count 1699
Applied a total of 203 rules in 275 ms. Remains 2498 /2501 variables (removed 3) and now considering 1699/1800 (removed 101) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1699 rows 2498 cols
[2024-05-29 14:10:13] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-29 14:10:14] [INFO ] [Real]Absence check using 1100 positive place invariants in 235 ms returned sat
[2024-05-29 14:10:15] [INFO ] After 1906ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:10:16] [INFO ] [Nat]Absence check using 1100 positive place invariants in 223 ms returned sat
[2024-05-29 14:10:19] [INFO ] After 2493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:10:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:10:19] [INFO ] After 397ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:10:20] [INFO ] After 976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 381 ms.
[2024-05-29 14:10:20] [INFO ] After 4758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 76 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:10:20] [INFO ] Computed 1101 invariants in 13 ms
[2024-05-29 14:10:22] [INFO ] Implicit Places using invariants in 1390 ms returned []
[2024-05-29 14:10:22] [INFO ] Invariant cache hit.
[2024-05-29 14:10:24] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 3240 ms to find 0 implicit places.
[2024-05-29 14:10:24] [INFO ] Invariant cache hit.
[2024-05-29 14:10:25] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4513 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92115 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92115 steps, saw 91178 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 14:10:29] [INFO ] Invariant cache hit.
[2024-05-29 14:10:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 231 ms returned sat
[2024-05-29 14:10:31] [INFO ] After 1326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-29 14:10:32] [INFO ] After 1712ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:10:32] [INFO ] After 2588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:10:32] [INFO ] [Nat]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:10:35] [INFO ] After 1999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:10:35] [INFO ] After 2592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 389 ms.
[2024-05-29 14:10:36] [INFO ] After 3890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1228 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 239 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 88070 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88070 steps, saw 84218 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:10:41] [INFO ] Computed 1101 invariants in 4 ms
[2024-05-29 14:10:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:10:43] [INFO ] After 2233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:10:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 206 ms returned sat
[2024-05-29 14:10:48] [INFO ] After 3555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:10:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:10:51] [INFO ] After 3733ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:10:54] [INFO ] After 6732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13729 ms.
[2024-05-29 14:11:08] [INFO ] After 24925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5117 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:11:13] [INFO ] Invariant cache hit.
[2024-05-29 14:11:15] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2024-05-29 14:11:15] [INFO ] Invariant cache hit.
[2024-05-29 14:11:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:11:17] [INFO ] Implicit Places using invariants and state equation in 2404 ms returned []
Implicit Place search using SMT with State Equation took 3898 ms to find 0 implicit places.
[2024-05-29 14:11:17] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-29 14:11:17] [INFO ] Invariant cache hit.
[2024-05-29 14:11:18] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5283 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 104 place count 2498 transition count 1798
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 203 place count 2498 transition count 1699
Applied a total of 203 rules in 279 ms. Remains 2498 /2501 variables (removed 3) and now considering 1699/1800 (removed 101) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1699 rows 2498 cols
[2024-05-29 14:11:19] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:11:20] [INFO ] [Real]Absence check using 1100 positive place invariants in 230 ms returned sat
[2024-05-29 14:11:21] [INFO ] After 2231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:11:22] [INFO ] [Nat]Absence check using 1100 positive place invariants in 226 ms returned sat
[2024-05-29 14:11:25] [INFO ] After 2791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:11:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:11:25] [INFO ] After 387ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:11:26] [INFO ] After 980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 383 ms.
[2024-05-29 14:11:26] [INFO ] After 5059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 1655 ms.
Product exploration explored 100000 steps with 0 reset in 2140 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 1802
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 462 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2024-05-29 14:11:31] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:11:31] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 14:11:32] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 1802/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1715 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Built C files in :
/tmp/ltsmin13232828154021431747
[2024-05-29 14:11:32] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13232828154021431747
Running compilation step : cd /tmp/ltsmin13232828154021431747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13232828154021431747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13232828154021431747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:11:35] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 14:11:37] [INFO ] Implicit Places using invariants in 1409 ms returned []
[2024-05-29 14:11:37] [INFO ] Invariant cache hit.
[2024-05-29 14:11:39] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 3364 ms to find 0 implicit places.
[2024-05-29 14:11:39] [INFO ] Invariant cache hit.
[2024-05-29 14:11:40] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4643 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Built C files in :
/tmp/ltsmin9591155524218414688
[2024-05-29 14:11:40] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9591155524218414688
Running compilation step : cd /tmp/ltsmin9591155524218414688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9591155524218414688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9591155524218414688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:11:43] [INFO ] Flatten gal took : 166 ms
[2024-05-29 14:11:43] [INFO ] Flatten gal took : 122 ms
[2024-05-29 14:11:43] [INFO ] Time to serialize gal into /tmp/LTL12196742683596990093.gal : 18 ms
[2024-05-29 14:11:43] [INFO ] Time to serialize properties into /tmp/LTL11981402314486638495.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12196742683596990093.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5931874476568592554.hoa' '-atoms' '/tmp/LTL11981402314486638495.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11981402314486638495.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5931874476568592554.hoa
Detected timeout of ITS tools.
[2024-05-29 14:11:59] [INFO ] Flatten gal took : 129 ms
[2024-05-29 14:11:59] [INFO ] Flatten gal took : 114 ms
[2024-05-29 14:11:59] [INFO ] Time to serialize gal into /tmp/LTL3927830681967231115.gal : 17 ms
[2024-05-29 14:11:59] [INFO ] Time to serialize properties into /tmp/LTL12664576731949256011.ltl : 11 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3927830681967231115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12664576731949256011.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("((p381==0)||(p2353==1))")U(X(G("((p1318==0)||(p290==1))")))))
Formula 0 simplified : !"((p381==0)||(p2353==1))" R XF!"((p1318==0)||(p290==1))"
Detected timeout of ITS tools.
[2024-05-29 14:12:14] [INFO ] Flatten gal took : 125 ms
[2024-05-29 14:12:14] [INFO ] Applying decomposition
[2024-05-29 14:12:14] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17102535756064798853.txt' '-o' '/tmp/graph17102535756064798853.bin' '-w' '/tmp/graph17102535756064798853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17102535756064798853.bin' '-l' '-1' '-v' '-w' '/tmp/graph17102535756064798853.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:12:15] [INFO ] Decomposing Gal with order
[2024-05-29 14:12:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:12:16] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 14:12:16] [INFO ] Flatten gal took : 167 ms
[2024-05-29 14:12:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 429 ms.
[2024-05-29 14:12:16] [INFO ] Time to serialize gal into /tmp/LTL4759576071614204179.gal : 33 ms
[2024-05-29 14:12:16] [INFO ] Time to serialize properties into /tmp/LTL2772476190382876769.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4759576071614204179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2772476190382876769.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((("((i5.i0.i0.i2.u122.p381==0)||(i28.u753.p2353==1))")U(X(G("((i17.u420.p1318==0)||(i4.u92.p290==1))")))))
Formula 0 simplified : !"((i5.i0.i0.i2.u122.p381==0)||(i28.u753.p2353==1))" R XF!"((i17.u420.p1318==0)||(i4.u92.p290==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10854985078534325847
[2024-05-29 14:12:31] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10854985078534325847
Running compilation step : cd /tmp/ltsmin10854985078534325847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10854985078534325847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10854985078534325847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-03 finished in 200071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 185 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:12:35] [INFO ] Computed 1101 invariants in 5 ms
[2024-05-29 14:12:36] [INFO ] Implicit Places using invariants in 1389 ms returned []
[2024-05-29 14:12:36] [INFO ] Invariant cache hit.
[2024-05-29 14:12:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:12:38] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 3313 ms to find 0 implicit places.
[2024-05-29 14:12:38] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-29 14:12:38] [INFO ] Invariant cache hit.
[2024-05-29 14:12:39] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4761 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Stuttering acceptance computed with spot in 2221 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2317 0) (EQ s134 1) (EQ s1618 0) (EQ s1830 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1583 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-04 finished in 8591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||F((G(F(p0))||(!p0&&F(p0)))))))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 82 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-29 14:12:44] [INFO ] Computed 1101 invariants in 4 ms
[2024-05-29 14:12:45] [INFO ] Implicit Places using invariants in 1390 ms returned []
[2024-05-29 14:12:45] [INFO ] Invariant cache hit.
[2024-05-29 14:12:47] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 3259 ms to find 0 implicit places.
[2024-05-29 14:12:47] [INFO ] Invariant cache hit.
[2024-05-29 14:12:48] [INFO ] Dead Transitions using invariants and state equation in 1220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4562 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), false, false, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s603 0) (EQ s1679 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7766 ms.
Product exploration explored 100000 steps with 50000 reset in 8043 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 1639 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-06 finished in 22874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G((X(X(p2))||p1))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 79 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2024-05-29 14:13:08] [INFO ] Invariant cache hit.
[2024-05-29 14:13:10] [INFO ] Implicit Places using invariants in 1411 ms returned []
[2024-05-29 14:13:10] [INFO ] Invariant cache hit.
[2024-05-29 14:13:12] [INFO ] Implicit Places using invariants and state equation in 1971 ms returned []
Implicit Place search using SMT with State Equation took 3384 ms to find 0 implicit places.
[2024-05-29 14:13:12] [INFO ] Invariant cache hit.
[2024-05-29 14:13:13] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4676 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s2099 0) (EQ s903 1)), p0:(AND (EQ s2198 0) (EQ s1318 1)), p2:(AND (NEQ s252 0) (NEQ s1406 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1615 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-11 finished in 8850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 93 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2024-05-29 14:13:15] [INFO ] Invariant cache hit.
[2024-05-29 14:13:16] [INFO ] Implicit Places using invariants in 1411 ms returned []
[2024-05-29 14:13:16] [INFO ] Invariant cache hit.
[2024-05-29 14:13:18] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 3423 ms to find 0 implicit places.
[2024-05-29 14:13:18] [INFO ] Invariant cache hit.
[2024-05-29 14:13:20] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4720 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1766 1), p1:(AND (OR (EQ s725 0) (EQ s678 1)) (OR (EQ s2125 0) (EQ s1566 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 0 reset in 1568 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-14 finished in 6428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-100A-LTLCardinality-03
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 178 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:13:22] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 14:13:24] [INFO ] Implicit Places using invariants in 1457 ms returned []
[2024-05-29 14:13:24] [INFO ] Invariant cache hit.
[2024-05-29 14:13:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:13:26] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 3455 ms to find 0 implicit places.
[2024-05-29 14:13:26] [INFO ] Invariant cache hit.
[2024-05-29 14:13:27] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4836 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1318 0) (EQ s290 1)), p0:(OR (EQ s381 0) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1557 ms.
Product exploration explored 100000 steps with 0 reset in 2034 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 104 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 90712 steps, run timeout after 3009 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90712 steps, saw 89579 distinct states, run finished after 3009 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 14:13:34] [INFO ] Invariant cache hit.
[2024-05-29 14:13:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:13:36] [INFO ] After 1150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-29 14:13:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:13:37] [INFO ] After 167ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:13:37] [INFO ] After 2161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:13:37] [INFO ] [Nat]Absence check using 1101 positive place invariants in 224 ms returned sat
[2024-05-29 14:13:41] [INFO ] After 3502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:13:41] [INFO ] After 403ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:13:42] [INFO ] After 1008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1670 ms.
[2024-05-29 14:13:44] [INFO ] After 7118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1048 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2501 transition count 1800
Applied a total of 398 rules in 167 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 80662 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80662 steps, saw 77002 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:13:49] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 14:13:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 225 ms returned sat
[2024-05-29 14:13:51] [INFO ] After 1961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:13:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 227 ms returned sat
[2024-05-29 14:13:54] [INFO ] After 2762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:13:54] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:13:59] [INFO ] After 4197ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:13:59] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2024-05-29 14:14:00] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2024-05-29 14:14:00] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2024-05-29 14:14:00] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2024-05-29 14:14:01] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:14:01] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2024-05-29 14:14:01] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:14:02] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2024-05-29 14:14:02] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:14:02] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:14:03] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 0 ms to minimize.
[2024-05-29 14:14:03] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:14:03] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 4 ms to minimize.
[2024-05-29 14:14:04] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 0 ms to minimize.
[2024-05-29 14:14:04] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 0 ms to minimize.
[2024-05-29 14:14:04] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 0 ms to minimize.
[2024-05-29 14:14:04] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 0 ms to minimize.
[2024-05-29 14:14:05] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:14:06] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 1 ms to minimize.
[2024-05-29 14:14:06] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 5 ms to minimize.
[2024-05-29 14:14:06] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2024-05-29 14:14:07] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:14:07] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:14:07] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:14:08] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 1 ms to minimize.
[2024-05-29 14:14:08] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2024-05-29 14:14:08] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 0 ms to minimize.
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 2 ms to minimize.
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:14:10] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 10428 ms
[2024-05-29 14:14:10] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 1 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 0 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 0 ms to minimize.
[2024-05-29 14:14:12] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2024-05-29 14:14:12] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:14:12] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2024-05-29 14:14:13] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 1 ms to minimize.
[2024-05-29 14:14:13] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2024-05-29 14:14:13] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2024-05-29 14:14:14] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2024-05-29 14:14:14] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 0 ms to minimize.
[2024-05-29 14:14:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4144 ms
[2024-05-29 14:14:16] [INFO ] After 21349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 14:14:16] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2366 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 81 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:14:18] [INFO ] Invariant cache hit.
[2024-05-29 14:14:20] [INFO ] Implicit Places using invariants in 1467 ms returned []
[2024-05-29 14:14:20] [INFO ] Invariant cache hit.
[2024-05-29 14:14:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:14:22] [INFO ] Implicit Places using invariants and state equation in 2465 ms returned []
Implicit Place search using SMT with State Equation took 3933 ms to find 0 implicit places.
[2024-05-29 14:14:22] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 14:14:22] [INFO ] Invariant cache hit.
[2024-05-29 14:14:24] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5290 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 104 place count 2498 transition count 1798
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 203 place count 2498 transition count 1699
Applied a total of 203 rules in 257 ms. Remains 2498 /2501 variables (removed 3) and now considering 1699/1800 (removed 101) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1699 rows 2498 cols
[2024-05-29 14:14:24] [INFO ] Computed 1100 invariants in 5 ms
[2024-05-29 14:14:25] [INFO ] [Real]Absence check using 1100 positive place invariants in 231 ms returned sat
[2024-05-29 14:14:26] [INFO ] After 1970ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:14:27] [INFO ] [Nat]Absence check using 1100 positive place invariants in 221 ms returned sat
[2024-05-29 14:14:29] [INFO ] After 2517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:14:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:14:30] [INFO ] After 389ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:14:30] [INFO ] After 980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 403 ms.
[2024-05-29 14:14:31] [INFO ] After 4800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 70 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:14:31] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 14:14:32] [INFO ] Implicit Places using invariants in 1417 ms returned []
[2024-05-29 14:14:32] [INFO ] Invariant cache hit.
[2024-05-29 14:14:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:14:34] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 3441 ms to find 0 implicit places.
[2024-05-29 14:14:34] [INFO ] Invariant cache hit.
[2024-05-29 14:14:36] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4723 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 91791 steps, run timeout after 3009 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91791 steps, saw 90653 distinct states, run finished after 3009 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 14:14:40] [INFO ] Invariant cache hit.
[2024-05-29 14:14:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 221 ms returned sat
[2024-05-29 14:14:42] [INFO ] After 1284ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-29 14:14:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:14:42] [INFO ] After 242ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:14:42] [INFO ] After 2420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:14:43] [INFO ] [Nat]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:14:45] [INFO ] After 1745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:14:45] [INFO ] After 410ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:14:46] [INFO ] After 1006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 389 ms.
[2024-05-29 14:14:46] [INFO ] After 4049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1483 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2501 transition count 1800
Applied a total of 398 rules in 167 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 81815 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81815 steps, saw 78126 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:14:52] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 14:14:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 232 ms returned sat
[2024-05-29 14:14:54] [INFO ] After 2211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:14:55] [INFO ] [Nat]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 14:14:59] [INFO ] After 3852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:14:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:15:02] [INFO ] After 3915ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:15:06] [INFO ] After 7142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13098 ms.
[2024-05-29 14:15:19] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6045 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 88 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:15:25] [INFO ] Invariant cache hit.
[2024-05-29 14:15:26] [INFO ] Implicit Places using invariants in 1465 ms returned []
[2024-05-29 14:15:26] [INFO ] Invariant cache hit.
[2024-05-29 14:15:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 14:15:29] [INFO ] Implicit Places using invariants and state equation in 2500 ms returned []
Implicit Place search using SMT with State Equation took 3968 ms to find 0 implicit places.
[2024-05-29 14:15:29] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:15:29] [INFO ] Invariant cache hit.
[2024-05-29 14:15:30] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5280 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 104 place count 2498 transition count 1798
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 203 place count 2498 transition count 1699
Applied a total of 203 rules in 247 ms. Remains 2498 /2501 variables (removed 3) and now considering 1699/1800 (removed 101) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1699 rows 2498 cols
[2024-05-29 14:15:30] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:15:31] [INFO ] [Real]Absence check using 1100 positive place invariants in 224 ms returned sat
[2024-05-29 14:15:33] [INFO ] After 2233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 14:15:33] [INFO ] [Nat]Absence check using 1100 positive place invariants in 241 ms returned sat
[2024-05-29 14:15:36] [INFO ] After 2820ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 14:15:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:15:37] [INFO ] After 388ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 14:15:37] [INFO ] After 988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 391 ms.
[2024-05-29 14:15:38] [INFO ] After 5154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 1598 ms.
Product exploration explored 100000 steps with 0 reset in 1991 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 82 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:15:42] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-29 14:15:42] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 14:15:43] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1355 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Built C files in :
/tmp/ltsmin7692622823902846051
[2024-05-29 14:15:43] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7692622823902846051
Running compilation step : cd /tmp/ltsmin7692622823902846051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7692622823902846051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7692622823902846051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 89 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-29 14:15:47] [INFO ] Invariant cache hit.
[2024-05-29 14:15:48] [INFO ] Implicit Places using invariants in 1365 ms returned []
[2024-05-29 14:15:48] [INFO ] Invariant cache hit.
[2024-05-29 14:15:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:15:50] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 3320 ms to find 0 implicit places.
[2024-05-29 14:15:50] [INFO ] Invariant cache hit.
[2024-05-29 14:15:51] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4582 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Built C files in :
/tmp/ltsmin15565213827302202245
[2024-05-29 14:15:51] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15565213827302202245
Running compilation step : cd /tmp/ltsmin15565213827302202245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15565213827302202245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15565213827302202245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:15:54] [INFO ] Flatten gal took : 104 ms
[2024-05-29 14:15:54] [INFO ] Flatten gal took : 124 ms
[2024-05-29 14:15:54] [INFO ] Time to serialize gal into /tmp/LTL5658197119525222054.gal : 9 ms
[2024-05-29 14:15:54] [INFO ] Time to serialize properties into /tmp/LTL6203741419966111293.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5658197119525222054.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16675266838187690132.hoa' '-atoms' '/tmp/LTL6203741419966111293.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6203741419966111293.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16675266838187690132.hoa
Detected timeout of ITS tools.
[2024-05-29 14:16:10] [INFO ] Flatten gal took : 104 ms
[2024-05-29 14:16:10] [INFO ] Flatten gal took : 108 ms
[2024-05-29 14:16:10] [INFO ] Time to serialize gal into /tmp/LTL16065475959018947703.gal : 8 ms
[2024-05-29 14:16:10] [INFO ] Time to serialize properties into /tmp/LTL5685942227629449108.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16065475959018947703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5685942227629449108.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("((p381==0)||(p2353==1))")U(X(G("((p1318==0)||(p290==1))")))))
Formula 0 simplified : !"((p381==0)||(p2353==1))" R XF!"((p1318==0)||(p290==1))"
Detected timeout of ITS tools.
[2024-05-29 14:16:25] [INFO ] Flatten gal took : 96 ms
[2024-05-29 14:16:25] [INFO ] Applying decomposition
[2024-05-29 14:16:25] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13153146542978068986.txt' '-o' '/tmp/graph13153146542978068986.bin' '-w' '/tmp/graph13153146542978068986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13153146542978068986.bin' '-l' '-1' '-v' '-w' '/tmp/graph13153146542978068986.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:16:25] [INFO ] Decomposing Gal with order
[2024-05-29 14:16:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:16:25] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 14:16:25] [INFO ] Flatten gal took : 108 ms
[2024-05-29 14:16:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 200 ms.
[2024-05-29 14:16:26] [INFO ] Time to serialize gal into /tmp/LTL17640616190196102053.gal : 22 ms
[2024-05-29 14:16:26] [INFO ] Time to serialize properties into /tmp/LTL4962542630393719000.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17640616190196102053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4962542630393719000.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((("((i4.u122.p381==0)||(i31.u753.p2353==1))")U(X(G("((i17.u420.p1318==0)||(i3.u92.p290==1))")))))
Formula 0 simplified : !"((i4.u122.p381==0)||(i31.u753.p2353==1))" R XF!"((i17.u420.p1318==0)||(i3.u92.p290==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9209958408498175220
[2024-05-29 14:16:41] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9209958408498175220
Running compilation step : cd /tmp/ltsmin9209958408498175220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9209958408498175220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9209958408498175220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-03 finished in 202605 ms.
[2024-05-29 14:16:44] [INFO ] Flatten gal took : 98 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5283975316881609552
[2024-05-29 14:16:44] [INFO ] Too many transitions (1802) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:16:44] [INFO ] Applying decomposition
[2024-05-29 14:16:44] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5283975316881609552
Running compilation step : cd /tmp/ltsmin5283975316881609552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 14:16:44] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10682095215080189671.txt' '-o' '/tmp/graph10682095215080189671.bin' '-w' '/tmp/graph10682095215080189671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10682095215080189671.bin' '-l' '-1' '-v' '-w' '/tmp/graph10682095215080189671.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:16:44] [INFO ] Decomposing Gal with order
[2024-05-29 14:16:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:16:44] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 14:16:45] [INFO ] Flatten gal took : 101 ms
[2024-05-29 14:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 250 ms.
[2024-05-29 14:16:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality3807161841546972475.gal : 56 ms
[2024-05-29 14:16:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality18372174144814358559.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3807161841546972475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18372174144814358559.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("((i4.u122.p381==0)||(i31.i0.i0.i0.u753.p2353==1))")U(X(G("((i17.u420.p1318==0)||(i2.i1.i0.i0.u92.p290==1))")))))
Formula 0 simplified : !"((i4.u122.p381==0)||(i31.i0.i0.i0.u753.p2353==1))" R XF!"((i17.u420.p1318==0)||(i2.i1.i0.i0.u92.p290==1))"
Compilation finished in 4048 ms.
Running link step : cd /tmp/ltsmin5283975316881609552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5283975316881609552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: LTL layer: formula: ((LTLAPp0==true) U X([]((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.020: "((LTLAPp0==true) U X([]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.049: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.050: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.050: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.071: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.510: There are 1805 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.510: State length is 2504, there are 1811 groups
pins2lts-mc-linux64( 0/ 8), 2.510: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.510: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.510: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.510: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 3.170: [Blue] ~117 levels ~960 states ~3808 transitions
pins2lts-mc-linux64( 0/ 8), 3.767: [Blue] ~240 levels ~1920 states ~8728 transitions
pins2lts-mc-linux64( 3/ 8), 5.194: [Blue] ~469 levels ~3840 states ~17256 transitions
pins2lts-mc-linux64( 3/ 8), 8.358: [Blue] ~948 levels ~7680 states ~39224 transitions
pins2lts-mc-linux64( 3/ 8), 12.431: [Blue] ~1901 levels ~15360 states ~81200 transitions
pins2lts-mc-linux64( 3/ 8), 15.015: [Blue] ~3811 levels ~30720 states ~171992 transitions
pins2lts-mc-linux64( 3/ 8), 19.989: [Blue] ~7637 levels ~61440 states ~384144 transitions
pins2lts-mc-linux64( 3/ 8), 29.561: [Blue] ~15287 levels ~122880 states ~774712 transitions
pins2lts-mc-linux64( 3/ 8), 48.245: [Blue] ~30613 levels ~245760 states ~1712832 transitions
pins2lts-mc-linux64( 6/ 8), 84.761: [Blue] ~61220 levels ~491520 states ~3221936 transitions
pins2lts-mc-linux64( 6/ 8), 156.787: [Blue] ~122496 levels ~983040 states ~6703928 transitions
pins2lts-mc-linux64( 3/ 8), 299.271: [Blue] ~245003 levels ~1966080 states ~14604992 transitions
pins2lts-mc-linux64( 2/ 8), 398.619: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 398.707:
pins2lts-mc-linux64( 0/ 8), 398.708: Explored 2119534 states 16525903 transitions, fanout: 7.797
pins2lts-mc-linux64( 0/ 8), 398.708: Total exploration time 396.180 sec (396.100 sec minimum, 396.128 sec on average)
pins2lts-mc-linux64( 0/ 8), 398.708: States per second: 5350, Transitions per second: 41713
pins2lts-mc-linux64( 0/ 8), 398.708:
pins2lts-mc-linux64( 0/ 8), 398.708: State space has 8977049 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 398.708: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 398.708: blue states: 2119534 (23.61%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 398.708: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 398.708: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 398.708:
pins2lts-mc-linux64( 0/ 8), 398.708: Total memory used for local state coloring: 32.2MB
pins2lts-mc-linux64( 0/ 8), 398.708:
pins2lts-mc-linux64( 0/ 8), 398.708: Queue width: 8B, total height: 2110626, memory: 16.10MB
pins2lts-mc-linux64( 0/ 8), 398.708: Tree memory: 324.5MB, 37.9 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 398.708: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 398.708: Stored 1833 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 398.708: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 398.708: Est. total memory use: 340.6MB (~1040.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5283975316881609552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U X([]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5283975316881609552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U X([]((LTLAPp1==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)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 14:40:06] [INFO ] Applying decomposition
[2024-05-29 14:40:06] [INFO ] Flatten gal took : 98 ms
[2024-05-29 14:40:06] [INFO ] Decomposing Gal with order
[2024-05-29 14:40:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:40:07] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 14:40:07] [INFO ] Flatten gal took : 115 ms
[2024-05-29 14:40:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 65 ms.
[2024-05-29 14:40:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality5473613456613834867.gal : 18 ms
[2024-05-29 14:40:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality16121003922708056851.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5473613456613834867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16121003922708056851.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("((i122.u214.p381==0)||(u1318.p2353==1))")U(X(G("((i420.u739.p1318==0)||(i92.u1675.p290==1))")))))
Formula 0 simplified : !"((i122.u214.p381==0)||(u1318.p2353==1))" R XF!"((i420.u739.p1318==0)||(i92.u1675.p290==1))"
Detected timeout of ITS tools.
[2024-05-29 15:03:44] [INFO ] Flatten gal took : 1478 ms
[2024-05-29 15:03:47] [INFO ] Input system was already deterministic with 1802 transitions.
[2024-05-29 15:03:47] [INFO ] Transformed 2503 places.
[2024-05-29 15:03:47] [INFO ] Transformed 1802 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
[2024-05-29 15:03:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality11006551830498958823.gal : 8 ms
[2024-05-29 15:03:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality8093269568047719056.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11006551830498958823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8093269568047719056.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.202304061127/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 : !((("((p381==0)||(p2353==1))")U(X(G("((p1318==0)||(p290==1))")))))
Formula 0 simplified : !"((p381==0)||(p2353==1))" R XF!"((p1318==0)||(p290==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13481396 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15908028 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-100A, 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 r373-tall-171683789300432"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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