MCC'2024- Execution of r003-smll-171620117500331

About the Execution of GreatSPN+red for Anderson-PT-06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1541.691	448379.00	508486.00	1543.00	TTTTFFFFTTTTTFTT	normal

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.r003-smll-171620117500331.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 Anderson-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117500331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 302K 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 Anderson-PT-06-LTLCardinality-00
FORMULA_NAME Anderson-PT-06-LTLCardinality-01
FORMULA_NAME Anderson-PT-06-LTLCardinality-02
FORMULA_NAME Anderson-PT-06-LTLCardinality-03
FORMULA_NAME Anderson-PT-06-LTLCardinality-04
FORMULA_NAME Anderson-PT-06-LTLCardinality-05
FORMULA_NAME Anderson-PT-06-LTLCardinality-06
FORMULA_NAME Anderson-PT-06-LTLCardinality-07
FORMULA_NAME Anderson-PT-06-LTLCardinality-08
FORMULA_NAME Anderson-PT-06-LTLCardinality-09
FORMULA_NAME Anderson-PT-06-LTLCardinality-10
FORMULA_NAME Anderson-PT-06-LTLCardinality-11
FORMULA_NAME Anderson-PT-06-LTLCardinality-12
FORMULA_NAME Anderson-PT-06-LTLCardinality-13
FORMULA_NAME Anderson-PT-06-LTLCardinality-14
FORMULA_NAME Anderson-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716429299086

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 01:55:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 01:55:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:55:01] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-23 01:55:01] [INFO ] Transformed 229 places.
[2024-05-23 01:55:01] [INFO ] Transformed 600 transitions.
[2024-05-23 01:55:01] [INFO ] Found NUPN structural information;
[2024-05-23 01:55:01] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 177 transition count 268
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 177 transition count 268
Applied a total of 104 rules in 72 ms. Remains 177 /229 variables (removed 52) and now considering 268/600 (removed 332) transitions.
// Phase 1: matrix 268 rows 177 cols
[2024-05-23 01:55:01] [INFO ] Computed 15 invariants in 47 ms
[2024-05-23 01:55:02] [INFO ] Implicit Places using invariants in 545 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 598 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/229 places, 268/600 transitions.
Applied a total of 0 rules in 16 ms. Remains 176 /176 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 726 ms. Remains : 176/229 places, 268/600 transitions.
Support contains 19 out of 176 places after structural reductions.
[2024-05-23 01:55:02] [INFO ] Flatten gal took : 83 ms
[2024-05-23 01:55:02] [INFO ] Flatten gal took : 34 ms
[2024-05-23 01:55:02] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 16739 steps (3 resets) in 833 ms. (20 steps per ms) remains 0/10 properties
FORMULA Anderson-PT-06-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(G((F(p0)&&F(G((p1 U p2))))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 268/268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 176 transition count 235
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 143 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 142 transition count 234
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 68 place count 142 transition count 207
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 122 place count 115 transition count 207
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 111 transition count 193
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 111 transition count 193
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 108 transition count 190
Applied a total of 136 rules in 100 ms. Remains 108 /176 variables (removed 68) and now considering 190/268 (removed 78) transitions.
// Phase 1: matrix 190 rows 108 cols
[2024-05-23 01:55:03] [INFO ] Computed 14 invariants in 6 ms
[2024-05-23 01:55:03] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-23 01:55:03] [INFO ] Invariant cache hit.
[2024-05-23 01:55:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 01:55:04] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-23 01:55:04] [INFO ] Redundant transitions in 8 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-23 01:55:04] [INFO ] Invariant cache hit.
[2024-05-23 01:55:04] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:06] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 18 ms to minimize.
[2024-05-23 01:55:06] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:55:06] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:55:06] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-23 01:55:06] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:55:06] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:55:07] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:55:07] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-23 01:55:07] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-23 01:55:07] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:55:07] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-23 01:55:07] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-23 01:55:07] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:08] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-23 01:55:08] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-23 01:55:08] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-23 01:55:08] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:55:08] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:55:08] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:55:08] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:55:08] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:55:09] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:55:10] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:11] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 3 ms to minimize.
[2024-05-23 01:55:11] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 5 ms to minimize.
[2024-05-23 01:55:11] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-23 01:55:11] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:55:11] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-23 01:55:11] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:12] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:55:12] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:55:12] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:55:12] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-23 01:55:12] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-05-23 01:55:12] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-23 01:55:12] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-23 01:55:13] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:55:13] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:55:13] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:55:13] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:55:13] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:55:13] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:14] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-23 01:55:14] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:55:14] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-23 01:55:14] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-23 01:55:14] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 3 ms to minimize.
[2024-05-23 01:55:15] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:55:15] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:16] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-23 01:55:16] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:55:16] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-05-23 01:55:16] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:55:16] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:55:17] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:18] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-23 01:55:18] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:19] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-23 01:55:19] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:55:20] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
[2024-05-23 01:55:20] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 190/298 variables, 108/201 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 30/231 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (OVERLAPS) 0/298 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 231 constraints, problems are : Problem set: 0 solved, 184 unsolved in 25077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 79/93 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-23 01:55:31] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-23 01:55:32] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:55:32] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:55:32] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:55:32] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:55:32] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-23 01:55:32] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:55:32] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:55:33] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-23 01:55:34] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 8 ms to minimize.
[2024-05-23 01:55:40] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-05-23 01:55:49] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-23 01:55:58] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:55:58] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-23 01:55:58] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:55:58] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 108/298 variables, and 119 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/108 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/184 constraints, Known Traps: 105/105 constraints]
After SMT, in 55406ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 55426ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/176 places, 190/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56230 ms. Remains : 108/176 places, 190/268 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-00
Product exploration explored 100000 steps with 509 reset in 450 ms.
Product exploration explored 100000 steps with 579 reset in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 207 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 330 ms. (120 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
[2024-05-23 01:56:01] [INFO ] Invariant cache hit.
[2024-05-23 01:56:01] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 190/298 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 30/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, ReadFeed: 30/30 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 108/298 variables, and 14 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/108 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (G (OR p1 p2)), (G (OR p1 p2))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 364 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 4 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 190/190 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-23 01:56:02] [INFO ] Invariant cache hit.
[2024-05-23 01:56:02] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 01:56:02] [INFO ] Invariant cache hit.
[2024-05-23 01:56:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 01:56:02] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-23 01:56:02] [INFO ] Redundant transitions in 8 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-23 01:56:02] [INFO ] Invariant cache hit.
[2024-05-23 01:56:02] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:03] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-05-23 01:56:04] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:56:05] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:56:05] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-23 01:56:05] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:05] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:56:05] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:56:05] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-23 01:56:06] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:56:07] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:56:07] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:56:07] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-23 01:56:07] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:56:07] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:56:07] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:08] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:56:08] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:56:08] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:56:09] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 4 ms to minimize.
[2024-05-23 01:56:09] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-23 01:56:09] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:09] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:56:09] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-23 01:56:09] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 5 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:56:10] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:11] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:56:11] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:56:12] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-23 01:56:12] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-23 01:56:12] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:56:12] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-23 01:56:12] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:13] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-23 01:56:13] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:56:14] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:56:15] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-23 01:56:15] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:16] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:56:16] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:17] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:56:17] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:56:17] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:56:17] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 190/298 variables, 108/201 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 30/231 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (OVERLAPS) 0/298 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 231 constraints, problems are : Problem set: 0 solved, 184 unsolved in 24216 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 79/93 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:28] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:56:28] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:56:28] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:28] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-05-23 01:56:28] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-23 01:56:28] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2024-05-23 01:56:28] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:28] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:56:29] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-23 01:56:31] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:56:31] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-23 01:56:46] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 108/298 variables, and 114 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/108 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/184 constraints, Known Traps: 100/100 constraints]
After SMT, in 54344ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 54348ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54817 ms. Remains : 108/108 places, 190/190 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X p0), (X p2), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 2151 steps (0 resets) in 13 ms. (153 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p2), (X p0), (X p2), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 520 reset in 145 ms.
Product exploration explored 100000 steps with 539 reset in 181 ms.
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 190/190 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 106 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 106 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 105 transition count 177
Applied a total of 6 rules in 18 ms. Remains 105 /108 variables (removed 3) and now considering 177/190 (removed 13) transitions.
// Phase 1: matrix 177 rows 105 cols
[2024-05-23 01:56:58] [INFO ] Computed 14 invariants in 4 ms
[2024-05-23 01:56:58] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-23 01:56:58] [INFO ] Invariant cache hit.
[2024-05-23 01:56:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 01:56:58] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-23 01:56:58] [INFO ] Redundant transitions in 2 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-23 01:56:58] [INFO ] Invariant cache hit.
[2024-05-23 01:56:58] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 01:57:00] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:57:00] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-05-23 01:57:00] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-23 01:57:01] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:57:02] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-23 01:57:02] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-23 01:57:02] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:57:02] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-23 01:57:02] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-23 01:57:02] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:57:03] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 177/282 variables, 105/150 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 30/180 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/282 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 180 constraints, problems are : Problem set: 0 solved, 171 unsolved in 12220 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 1/105 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 01:57:13] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:57:13] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-05-23 01:57:13] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-23 01:57:13] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 177/282 variables, 105/154 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 30/184 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 171/355 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 01:57:26] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-23 01:57:26] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-23 01:57:26] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-23 01:57:26] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-23 01:57:26] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-23 01:57:26] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
[2024-05-23 01:57:26] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-23 01:57:26] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 01:57:33] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 364 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 44/44 constraints]
After SMT, in 42335ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 42339ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 177/190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42761 ms. Remains : 105/108 places, 177/190 transitions.
Treatment of property Anderson-PT-06-LTLCardinality-00 finished in 157464 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(X(X(G((G(p1)||p0))))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 268/268 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 170 transition count 252
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 252
Applied a total of 12 rules in 8 ms. Remains 170 /176 variables (removed 6) and now considering 252/268 (removed 16) transitions.
// Phase 1: matrix 252 rows 170 cols
[2024-05-23 01:57:40] [INFO ] Computed 14 invariants in 4 ms
[2024-05-23 01:57:41] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-23 01:57:41] [INFO ] Invariant cache hit.
[2024-05-23 01:57:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 01:57:41] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2024-05-23 01:57:41] [INFO ] Invariant cache hit.
[2024-05-23 01:57:41] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:57:43] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:57:44] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 2 ms to minimize.
[2024-05-23 01:57:44] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:57:44] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-05-23 01:57:44] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:57:44] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:57:44] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:57:44] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:57:44] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:57:45] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:57:45] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:57:45] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:57:45] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:57:45] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:57:46] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:57:46] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:57:46] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:57:46] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:57:46] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 3 ms to minimize.
[2024-05-23 01:57:47] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:57:47] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 3 ms to minimize.
[2024-05-23 01:57:47] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:57:47] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:57:47] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:57:47] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:57:47] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:57:47] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:57:48] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:57:48] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-23 01:57:48] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:57:48] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:57:48] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:57:48] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:57:48] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:57:50] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:57:50] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-23 01:57:51] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:57:51] [INFO ] Deduced a trap composed of 110 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:57:51] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:57:51] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:57:51] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:57:52] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:57:53] [INFO ] Deduced a trap composed of 115 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:57:53] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:57:54] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:57:54] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:57:54] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:57:55] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:57:55] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:57:55] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:57:55] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:57:55] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:57:55] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 3 ms to minimize.
[2024-05-23 01:57:55] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:57:56] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 3 ms to minimize.
[2024-05-23 01:57:56] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:57:57] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:57:59] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-23 01:58:00] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:58:00] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:58:00] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:58:00] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:58:00] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:58:01] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:58:01] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:58:03] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2024-05-23 01:58:03] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:58:05] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-23 01:58:05] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:58:05] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:58:05] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:58:08] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:58:11] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/422 variables, and 94 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/170 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 80/94 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 01:58:14] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:58:14] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:58:14] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 252/422 variables, 170/267 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 30/297 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 246/543 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 543 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 83/83 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 252/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60875 ms. Remains : 170/176 places, 252/268 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1027 steps with 0 reset in 2 ms.
FORMULA Anderson-PT-06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLCardinality-04 finished in 61107 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(p0))'
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 268/268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 176 transition count 233
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 141 transition count 233
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 70 place count 141 transition count 203
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 111 transition count 203
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 103 transition count 175
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 103 transition count 175
Applied a total of 146 rules in 22 ms. Remains 103 /176 variables (removed 73) and now considering 175/268 (removed 93) transitions.
// Phase 1: matrix 175 rows 103 cols
[2024-05-23 01:58:42] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 01:58:42] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-23 01:58:42] [INFO ] Invariant cache hit.
[2024-05-23 01:58:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 01:58:42] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-23 01:58:42] [INFO ] Redundant transitions in 2 ms returned []
Running 169 sub problems to find dead transitions.
[2024-05-23 01:58:42] [INFO ] Invariant cache hit.
[2024-05-23 01:58:42] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 01:58:43] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-23 01:58:43] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-23 01:58:43] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-23 01:58:43] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-23 01:58:44] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 01:58:45] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-05-23 01:58:45] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-23 01:58:45] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-23 01:58:45] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-23 01:58:45] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-23 01:58:45] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-23 01:58:45] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-05-23 01:58:46] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-23 01:58:46] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:58:46] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-05-23 01:58:46] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:58:46] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-23 01:58:46] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:58:46] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:58:46] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 01:58:48] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
[2024-05-23 01:58:48] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:58:48] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:58:48] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 175/278 variables, 103/152 constraints. Problems are: Problem set: 0 solved, 169 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 30/182 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/278 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 182 constraints, problems are : Problem set: 0 solved, 169 unsolved in 12452 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 01:58:57] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-23 01:58:57] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-23 01:58:58] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 01:59:01] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-05-23 01:59:01] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-23 01:59:02] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-23 01:59:02] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:59:02] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 2 ms to minimize.
[2024-05-23 01:59:02] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 01:59:05] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-23 01:59:05] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-05-23 01:59:06] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-23 01:59:06] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-05-23 01:59:06] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 01:59:17] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-23 01:59:18] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 175/278 variables, 103/168 constraints. Problems are: Problem set: 0 solved, 169 unsolved
SMT process timed out in 42548ms, After SMT, problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 42550ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/176 places, 175/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43016 ms. Remains : 103/176 places, 175/268 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-05
Product exploration explored 100000 steps with 330 reset in 180 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Anderson-PT-06-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLCardinality-05 finished in 43257 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((F(p1)||p0)))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 268/268 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 170 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 242
Applied a total of 12 rules in 3 ms. Remains 170 /176 variables (removed 6) and now considering 242/268 (removed 26) transitions.
// Phase 1: matrix 242 rows 170 cols
[2024-05-23 01:59:25] [INFO ] Computed 14 invariants in 3 ms
[2024-05-23 01:59:25] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-23 01:59:25] [INFO ] Invariant cache hit.
[2024-05-23 01:59:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 01:59:25] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-23 01:59:25] [INFO ] Invariant cache hit.
[2024-05-23 01:59:25] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-23 01:59:29] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:59:29] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:59:30] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:59:30] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:59:30] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:59:30] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 3 ms to minimize.
[2024-05-23 01:59:30] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:59:30] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:59:30] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:59:30] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:59:31] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:59:31] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:59:31] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:59:31] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-23 01:59:31] [INFO ] Deduced a trap composed of 114 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:59:31] [INFO ] Deduced a trap composed of 110 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:59:31] [INFO ] Deduced a trap composed of 120 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:59:31] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:59:32] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:59:32] [INFO ] Deduced a trap composed of 124 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-23 01:59:33] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:59:33] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:59:33] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:59:33] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:59:33] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 3 ms to minimize.
[2024-05-23 01:59:33] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:59:33] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:59:33] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 109 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 114 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 10 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-05-23 01:59:34] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:59:35] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-05-23 01:59:35] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:59:35] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 242/412 variables, 170/224 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 30/254 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (OVERLAPS) 0/412 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 254 constraints, problems are : Problem set: 0 solved, 236 unsolved in 20707 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-23 01:59:50] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 3 ms to minimize.
[2024-05-23 01:59:50] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-23 01:59:50] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-23 01:59:50] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-23 01:59:50] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:59:50] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:59:50] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-23 01:59:50] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:59:51] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 11 ms to minimize.
[2024-05-23 01:59:52] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-23 01:59:52] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-23 01:59:53] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:59:53] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:59:54] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:59:54] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:59:54] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:59:54] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:59:54] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:59:54] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 1 ms to minimize.
[2024-05-23 01:59:54] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-05-23 01:59:55] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:59:55] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 242/412 variables, 170/255 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 30/285 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 521 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 71/71 constraints]
After SMT, in 50824ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 50827ms
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 242/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51503 ms. Remains : 170/176 places, 242/268 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLCardinality-08 finished in 51966 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((F(p0)&&F(G((p1 U p2))))))'
[2024-05-23 02:00:17] [INFO ] Flatten gal took : 22 ms
[2024-05-23 02:00:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 02:00:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 268 transitions and 928 arcs took 20 ms.
Total runtime 316668 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 176
TRANSITIONS: 268
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.004s]

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

----------------------------------------------------------------------
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: 2231
MODEL NAME: /home/mcc/execution/413/model
176 places, 268 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 Anderson-PT-06-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716429747465

--------------------
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

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="Anderson-PT-06"
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 Anderson-PT-06, 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 r003-smll-171620117500331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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