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.r091-tall-171624188300715.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 greatspnxred
Input is DES-PT-40a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300715
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 83K May 18 16:42 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 DES-PT-40a-LTLCardinality-00
FORMULA_NAME DES-PT-40a-LTLCardinality-01
FORMULA_NAME DES-PT-40a-LTLCardinality-02
FORMULA_NAME DES-PT-40a-LTLCardinality-03
FORMULA_NAME DES-PT-40a-LTLCardinality-04
FORMULA_NAME DES-PT-40a-LTLCardinality-05
FORMULA_NAME DES-PT-40a-LTLCardinality-06
FORMULA_NAME DES-PT-40a-LTLCardinality-07
FORMULA_NAME DES-PT-40a-LTLCardinality-08
FORMULA_NAME DES-PT-40a-LTLCardinality-09
FORMULA_NAME DES-PT-40a-LTLCardinality-10
FORMULA_NAME DES-PT-40a-LTLCardinality-11
FORMULA_NAME DES-PT-40a-LTLCardinality-12
FORMULA_NAME DES-PT-40a-LTLCardinality-13
FORMULA_NAME DES-PT-40a-LTLCardinality-14
FORMULA_NAME DES-PT-40a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716322288095

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 20:11:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 20:11:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:11:29] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 20:11:29] [INFO ] Transformed 274 places.
[2024-05-21 20:11:29] [INFO ] Transformed 231 transitions.
[2024-05-21 20:11:29] [INFO ] Found NUPN structural information;
[2024-05-21 20:11:29] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 273 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 216
Applied a total of 2 rules in 59 ms. Remains 273 /274 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 273 cols
[2024-05-21 20:11:29] [INFO ] Computed 59 invariants in 30 ms
[2024-05-21 20:11:30] [INFO ] Implicit Places using invariants in 364 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 394 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 272/274 places, 216/217 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 478 ms. Remains : 272/274 places, 216/217 transitions.
Support contains 12 out of 272 places after structural reductions.
[2024-05-21 20:11:30] [INFO ] Flatten gal took : 50 ms
[2024-05-21 20:11:30] [INFO ] Flatten gal took : 23 ms
[2024-05-21 20:11:30] [INFO ] Input system was already deterministic with 216 transitions.
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (888 resets) in 785 ms. (50 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (176 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
// Phase 1: matrix 216 rows 272 cols
[2024-05-21 20:11:30] [INFO ] Computed 58 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/207 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/229 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/444 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/488 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/488 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/207 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/229 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/444 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/488 variables, 43/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/488 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 292 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 272 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 213
Applied a total of 9 rules in 63 ms. Remains 271 /272 variables (removed 1) and now considering 213/216 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 271/272 places, 213/216 transitions.
RANDOM walk for 40000 steps (542 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (88 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1540629 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :0 out of 1
Probabilistic random walk after 1540629 steps, saw 215650 distinct states, run finished after 3004 ms. (steps per millisecond=512 ) properties seen :0
// Phase 1: matrix 213 rows 271 cols
[2024-05-21 20:11:34] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 20:11:34] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/188 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/213 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/220 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 170/390 variables, 220/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/402 variables, 8/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/403 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 42/445 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/445 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/445 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 39/484 variables, 39/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/188 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/213 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/220 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 170/390 variables, 220/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/402 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 3 ms to minimize.
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/402 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/402 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/403 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/403 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/403 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/403 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 42/445 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/445 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/445 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 39/484 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 991ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1089 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=272 )
Parikh walk visited 1 properties in 7 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2024-05-21 20:11:35] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 20:11:36] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 20:11:36] [INFO ] Invariant cache hit.
[2024-05-21 20:11:36] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-05-21 20:11:36] [INFO ] Redundant transitions in 9 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-21 20:11:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 215/485 variables, 270/328 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:11:41] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-21 20:11:41] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
[2024-05-21 20:11:41] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
[2024-05-21 20:11:41] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:11:44] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:11:46] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:11:49] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (OVERLAPS) 1/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:11:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/486 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:12:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 215/485 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/486 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60716 ms. Remains : 271/272 places, 215/216 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-04
Stuttering criterion allowed to conclude after 363 steps with 6 reset in 8 ms.
FORMULA DES-PT-40a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-04 finished in 60943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 11 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
[2024-05-21 20:12:36] [INFO ] Invariant cache hit.
[2024-05-21 20:12:36] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 20:12:36] [INFO ] Invariant cache hit.
[2024-05-21 20:12:37] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-21 20:12:37] [INFO ] Redundant transitions in 12 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-21 20:12:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 215/485 variables, 270/328 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:12:42] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:12:42] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:12:42] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-21 20:12:42] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:12:44] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:12:46] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:12:49] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (OVERLAPS) 1/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:12:58] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/486 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:13:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 29490 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 215/485 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/486 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
After SMT, in 59615ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 59618ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60074 ms. Remains : 271/272 places, 215/216 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-05
Product exploration explored 100000 steps with 2274 reset in 315 ms.
Product exploration explored 100000 steps with 2297 reset in 262 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 707 steps (14 resets) in 15 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 14 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-21 20:13:37] [INFO ] Invariant cache hit.
[2024-05-21 20:13:37] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 20:13:37] [INFO ] Invariant cache hit.
[2024-05-21 20:13:38] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-21 20:13:38] [INFO ] Redundant transitions in 2 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-21 20:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 215/485 variables, 270/328 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:13:43] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:13:43] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:13:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:13:43] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:13:45] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:13:47] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:13:50] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (OVERLAPS) 1/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:13:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/486 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:14:01] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 29551 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 215/485 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/486 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
After SMT, in 59686ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 59690ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60106 ms. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 672 steps (12 resets) in 8 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2273 reset in 192 ms.
Product exploration explored 100000 steps with 2252 reset in 215 ms.
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-21 20:14:38] [INFO ] Invariant cache hit.
[2024-05-21 20:14:38] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-21 20:14:38] [INFO ] Invariant cache hit.
[2024-05-21 20:14:39] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-21 20:14:39] [INFO ] Redundant transitions in 2 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-21 20:14:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 215/485 variables, 270/328 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:14:44] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:14:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
[2024-05-21 20:14:44] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-21 20:14:44] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:14:46] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:14:48] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:14:51] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (OVERLAPS) 1/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:15:01] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/486 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-21 20:15:02] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 215/485 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/486 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60537 ms. Remains : 271/271 places, 215/215 transitions.
Treatment of property DES-PT-40a-LTLCardinality-05 finished in 182464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!p1))||X(X(G(p2)))))'
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2024-05-21 20:15:39] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 20:15:39] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 20:15:39] [INFO ] Invariant cache hit.
[2024-05-21 20:15:39] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-21 20:15:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/488 variables, 272/330 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-21 20:15:43] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:15:44] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:15:44] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:15:44] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:15:44] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 335 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10032 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/488 variables, 272/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 215/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 550 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
After SMT, in 40166ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40168ms
Finished structural reductions in LTL mode , in 1 iterations and 40552 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 385 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), true, (AND (NOT p2) p1), (AND p1 (NOT p2)), p1, p1]
Running random walk in product with property : DES-PT-40a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-08 finished in 40959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-21 20:16:20] [INFO ] Invariant cache hit.
[2024-05-21 20:16:20] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 20:16:20] [INFO ] Invariant cache hit.
[2024-05-21 20:16:20] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-21 20:16:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/488 variables, 272/330 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-21 20:16:24] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-21 20:16:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:16:25] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:16:25] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:16:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 335 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10094 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/488 variables, 272/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 215/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 550 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
After SMT, in 40239ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40241ms
Finished structural reductions in LTL mode , in 1 iterations and 40633 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA DES-PT-40a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-09 finished in 40746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(X(G(p2))||p1))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-21 20:17:00] [INFO ] Invariant cache hit.
[2024-05-21 20:17:01] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 20:17:01] [INFO ] Invariant cache hit.
[2024-05-21 20:17:01] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-21 20:17:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/488 variables, 272/330 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-21 20:17:05] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:17:05] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:17:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:17:06] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:17:06] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 335 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10102 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/488 variables, 272/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 215/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 550 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
After SMT, in 40256ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40259ms
Finished structural reductions in LTL mode , in 1 iterations and 40645 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-12 finished in 40803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-21 20:17:41] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:17:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 20:17:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 272 places, 216 transitions and 1045 arcs took 6 ms.
Total runtime 372698 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-40a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 272
TRANSITIONS: 216
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 988
MODEL NAME: /home/mcc/execution/409/model
272 places, 216 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-40a-LTLCardinality-05 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716322898613

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

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="DES-PT-40a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DES-PT-40a, 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 r091-tall-171624188300715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;