Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017300857.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-PT-S10J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300857
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 40K Apr 30 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 30 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 30 03:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 30 03:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M May 10 09:34 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 PolyORBNT-PT-S10J30-CTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652970047808

Running Version 202205111006
[2022-05-19 14:20:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 14:20:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 14:20:49] [INFO ] Load time of PNML (sax parser for PT used): 636 ms
[2022-05-19 14:20:49] [INFO ] Transformed 664 places.
[2022-05-19 14:20:49] [INFO ] Transformed 12050 transitions.
[2022-05-19 14:20:49] [INFO ] Parsed PT model containing 664 places and 12050 transitions in 869 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 575 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 73 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2022-05-19 14:20:50] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2022-05-19 14:20:50] [INFO ] Computed 92 place invariants in 121 ms
[2022-05-19 14:20:51] [INFO ] Dead Transitions using invariants and state equation in 1742 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 14:20:51] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2022-05-19 14:20:51] [INFO ] Computed 92 place invariants in 65 ms
[2022-05-19 14:20:52] [INFO ] Implicit Places using invariants in 265 ms returned []
[2022-05-19 14:20:52] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2022-05-19 14:20:52] [INFO ] Computed 92 place invariants in 20 ms
[2022-05-19 14:20:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:20:52] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 17 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 664/664 places, 1325/1940 transitions.
Support contains 575 out of 664 places after structural reductions.
[2022-05-19 14:20:53] [INFO ] Flatten gal took : 261 ms
[2022-05-19 14:20:53] [INFO ] Flatten gal took : 128 ms
[2022-05-19 14:20:53] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 79) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 73) seen :7
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Running SMT prover for 66 properties.
[2022-05-19 14:20:55] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2022-05-19 14:20:55] [INFO ] Computed 92 place invariants in 26 ms
[2022-05-19 14:20:57] [INFO ] [Real]Absence check using 62 positive place invariants in 16 ms returned sat
[2022-05-19 14:20:57] [INFO ] [Real]Absence check using 62 positive and 30 generalized place invariants in 34 ms returned sat
[2022-05-19 14:20:57] [INFO ] After 1804ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:61
[2022-05-19 14:20:58] [INFO ] [Nat]Absence check using 62 positive place invariants in 17 ms returned sat
[2022-05-19 14:20:58] [INFO ] [Nat]Absence check using 62 positive and 30 generalized place invariants in 32 ms returned sat
[2022-05-19 14:21:22] [INFO ] After 23970ms SMT Verify possible using state equation in natural domain returned unsat :53 sat :12
[2022-05-19 14:21:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:21:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:21:22] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0 real:61
Fused 66 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 32 out of 664 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 654 transition count 1293
Reduce places removed 32 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 77 place count 622 transition count 1290
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 619 transition count 1290
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 80 place count 619 transition count 1258
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 144 place count 587 transition count 1258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 586 transition count 1257
Applied a total of 146 rules in 213 ms. Remains 586 /664 variables (removed 78) and now considering 1257/1325 (removed 68) transitions.
[2022-05-19 14:21:22] [INFO ] Flow matrix only has 1248 transitions (discarded 9 similar events)
// Phase 1: matrix 1248 rows 586 cols
[2022-05-19 14:21:22] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 14:21:23] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 586/664 places, 1257/1325 transitions.
Incomplete random walk after 10000 steps, including 711 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2022-05-19 14:21:23] [INFO ] Flow matrix only has 1248 transitions (discarded 9 similar events)
// Phase 1: matrix 1248 rows 586 cols
[2022-05-19 14:21:23] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 14:21:23] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:21:24] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 14:21:24] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 28 ms returned sat
[2022-05-19 14:21:25] [INFO ] After 1132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:21:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:21:26] [INFO ] After 723ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 14:21:30] [INFO ] Deduced a trap composed of 148 places in 315 ms of which 3 ms to minimize.
[2022-05-19 14:21:30] [INFO ] Deduced a trap composed of 148 places in 326 ms of which 1 ms to minimize.
[2022-05-19 14:21:30] [INFO ] Deduced a trap composed of 107 places in 315 ms of which 2 ms to minimize.
[2022-05-19 14:21:31] [INFO ] Deduced a trap composed of 131 places in 302 ms of which 1 ms to minimize.
[2022-05-19 14:21:31] [INFO ] Deduced a trap composed of 115 places in 321 ms of which 1 ms to minimize.
[2022-05-19 14:21:31] [INFO ] Deduced a trap composed of 123 places in 296 ms of which 1 ms to minimize.
[2022-05-19 14:21:32] [INFO ] Deduced a trap composed of 123 places in 310 ms of which 1 ms to minimize.
[2022-05-19 14:21:32] [INFO ] Deduced a trap composed of 131 places in 308 ms of which 1 ms to minimize.
[2022-05-19 14:21:32] [INFO ] Deduced a trap composed of 107 places in 309 ms of which 1 ms to minimize.
[2022-05-19 14:21:33] [INFO ] Deduced a trap composed of 123 places in 314 ms of which 0 ms to minimize.
[2022-05-19 14:21:33] [INFO ] Deduced a trap composed of 115 places in 312 ms of which 0 ms to minimize.
[2022-05-19 14:21:34] [INFO ] Deduced a trap composed of 147 places in 314 ms of which 1 ms to minimize.
[2022-05-19 14:21:34] [INFO ] Deduced a trap composed of 140 places in 309 ms of which 0 ms to minimize.
[2022-05-19 14:21:34] [INFO ] Deduced a trap composed of 116 places in 305 ms of which 0 ms to minimize.
[2022-05-19 14:21:35] [INFO ] Deduced a trap composed of 123 places in 292 ms of which 1 ms to minimize.
[2022-05-19 14:21:35] [INFO ] Deduced a trap composed of 123 places in 288 ms of which 1 ms to minimize.
[2022-05-19 14:21:35] [INFO ] Deduced a trap composed of 131 places in 308 ms of which 1 ms to minimize.
[2022-05-19 14:21:36] [INFO ] Deduced a trap composed of 123 places in 310 ms of which 1 ms to minimize.
[2022-05-19 14:21:36] [INFO ] Deduced a trap composed of 107 places in 301 ms of which 0 ms to minimize.
[2022-05-19 14:21:36] [INFO ] Deduced a trap composed of 107 places in 313 ms of which 1 ms to minimize.
[2022-05-19 14:21:37] [INFO ] Deduced a trap composed of 123 places in 316 ms of which 1 ms to minimize.
[2022-05-19 14:21:37] [INFO ] Deduced a trap composed of 107 places in 312 ms of which 0 ms to minimize.
[2022-05-19 14:21:37] [INFO ] Deduced a trap composed of 131 places in 318 ms of which 0 ms to minimize.
[2022-05-19 14:21:38] [INFO ] Deduced a trap composed of 131 places in 322 ms of which 0 ms to minimize.
[2022-05-19 14:21:38] [INFO ] Deduced a trap composed of 123 places in 314 ms of which 0 ms to minimize.
[2022-05-19 14:21:39] [INFO ] Deduced a trap composed of 115 places in 312 ms of which 0 ms to minimize.
[2022-05-19 14:21:39] [INFO ] Deduced a trap composed of 107 places in 308 ms of which 0 ms to minimize.
[2022-05-19 14:21:39] [INFO ] Deduced a trap composed of 123 places in 309 ms of which 1 ms to minimize.
[2022-05-19 14:21:40] [INFO ] Deduced a trap composed of 107 places in 317 ms of which 1 ms to minimize.
[2022-05-19 14:21:40] [INFO ] Deduced a trap composed of 115 places in 307 ms of which 1 ms to minimize.
[2022-05-19 14:21:40] [INFO ] Deduced a trap composed of 99 places in 289 ms of which 1 ms to minimize.
[2022-05-19 14:21:41] [INFO ] Deduced a trap composed of 123 places in 313 ms of which 0 ms to minimize.
[2022-05-19 14:21:41] [INFO ] Deduced a trap composed of 139 places in 310 ms of which 0 ms to minimize.
[2022-05-19 14:21:42] [INFO ] Deduced a trap composed of 155 places in 316 ms of which 1 ms to minimize.
[2022-05-19 14:21:43] [INFO ] Deduced a trap composed of 123 places in 325 ms of which 2 ms to minimize.
[2022-05-19 14:21:46] [INFO ] Deduced a trap composed of 274 places in 298 ms of which 0 ms to minimize.
[2022-05-19 14:21:46] [INFO ] Deduced a trap composed of 250 places in 298 ms of which 1 ms to minimize.
[2022-05-19 14:21:47] [INFO ] Deduced a trap composed of 255 places in 306 ms of which 0 ms to minimize.
[2022-05-19 14:21:47] [INFO ] Deduced a trap composed of 246 places in 304 ms of which 0 ms to minimize.
[2022-05-19 14:21:48] [INFO ] Deduced a trap composed of 246 places in 308 ms of which 1 ms to minimize.
[2022-05-19 14:21:49] [INFO ] Deduced a trap composed of 275 places in 304 ms of which 0 ms to minimize.
[2022-05-19 14:21:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:21:49] [INFO ] After 25133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 586/586 places, 1257/1257 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 586 transition count 1256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 585 transition count 1256
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 585 transition count 1253
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 580 transition count 1251
Applied a total of 12 rules in 96 ms. Remains 580 /586 variables (removed 6) and now considering 1251/1257 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/586 places, 1251/1257 transitions.
Incomplete random walk after 10000 steps, including 706 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273529 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273529 steps, saw 44972 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-19 14:21:52] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:21:52] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:21:52] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:21:52] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2022-05-19 14:21:52] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 14:21:53] [INFO ] After 1288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:21:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:21:54] [INFO ] After 346ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 14:22:02] [INFO ] Deduced a trap composed of 126 places in 295 ms of which 1 ms to minimize.
[2022-05-19 14:22:02] [INFO ] Deduced a trap composed of 117 places in 300 ms of which 0 ms to minimize.
[2022-05-19 14:22:03] [INFO ] Deduced a trap composed of 109 places in 309 ms of which 0 ms to minimize.
[2022-05-19 14:22:03] [INFO ] Deduced a trap composed of 158 places in 310 ms of which 1 ms to minimize.
[2022-05-19 14:22:04] [INFO ] Deduced a trap composed of 126 places in 310 ms of which 0 ms to minimize.
[2022-05-19 14:22:04] [INFO ] Deduced a trap composed of 261 places in 308 ms of which 1 ms to minimize.
[2022-05-19 14:22:04] [INFO ] Deduced a trap composed of 261 places in 288 ms of which 1 ms to minimize.
[2022-05-19 14:22:05] [INFO ] Deduced a trap composed of 125 places in 305 ms of which 0 ms to minimize.
[2022-05-19 14:22:05] [INFO ] Deduced a trap composed of 221 places in 302 ms of which 0 ms to minimize.
[2022-05-19 14:22:05] [INFO ] Deduced a trap composed of 206 places in 307 ms of which 1 ms to minimize.
[2022-05-19 14:22:06] [INFO ] Deduced a trap composed of 117 places in 305 ms of which 1 ms to minimize.
[2022-05-19 14:22:06] [INFO ] Deduced a trap composed of 125 places in 292 ms of which 1 ms to minimize.
[2022-05-19 14:22:06] [INFO ] Deduced a trap composed of 126 places in 286 ms of which 1 ms to minimize.
[2022-05-19 14:22:07] [INFO ] Deduced a trap composed of 126 places in 303 ms of which 0 ms to minimize.
[2022-05-19 14:22:07] [INFO ] Deduced a trap composed of 126 places in 306 ms of which 1 ms to minimize.
[2022-05-19 14:22:07] [INFO ] Deduced a trap composed of 212 places in 308 ms of which 2 ms to minimize.
[2022-05-19 14:22:08] [INFO ] Deduced a trap composed of 125 places in 286 ms of which 1 ms to minimize.
[2022-05-19 14:22:08] [INFO ] Deduced a trap composed of 257 places in 295 ms of which 1 ms to minimize.
[2022-05-19 14:22:08] [INFO ] Deduced a trap composed of 134 places in 286 ms of which 0 ms to minimize.
[2022-05-19 14:22:09] [INFO ] Deduced a trap composed of 101 places in 306 ms of which 1 ms to minimize.
[2022-05-19 14:22:09] [INFO ] Deduced a trap composed of 126 places in 287 ms of which 1 ms to minimize.
[2022-05-19 14:22:10] [INFO ] Deduced a trap composed of 230 places in 307 ms of which 1 ms to minimize.
[2022-05-19 14:22:10] [INFO ] Deduced a trap composed of 133 places in 290 ms of which 1 ms to minimize.
[2022-05-19 14:22:10] [INFO ] Deduced a trap composed of 109 places in 292 ms of which 1 ms to minimize.
[2022-05-19 14:22:11] [INFO ] Deduced a trap composed of 227 places in 309 ms of which 3 ms to minimize.
[2022-05-19 14:22:11] [INFO ] Deduced a trap composed of 134 places in 311 ms of which 2 ms to minimize.
[2022-05-19 14:22:11] [INFO ] Deduced a trap composed of 133 places in 311 ms of which 2 ms to minimize.
[2022-05-19 14:22:13] [INFO ] Deduced a trap composed of 125 places in 290 ms of which 2 ms to minimize.
[2022-05-19 14:22:13] [INFO ] Deduced a trap composed of 117 places in 306 ms of which 1 ms to minimize.
[2022-05-19 14:22:14] [INFO ] Deduced a trap composed of 133 places in 306 ms of which 0 ms to minimize.
[2022-05-19 14:22:14] [INFO ] Deduced a trap composed of 133 places in 303 ms of which 1 ms to minimize.
[2022-05-19 14:22:14] [INFO ] Deduced a trap composed of 149 places in 310 ms of which 1 ms to minimize.
[2022-05-19 14:22:15] [INFO ] Deduced a trap composed of 101 places in 298 ms of which 1 ms to minimize.
[2022-05-19 14:22:15] [INFO ] Deduced a trap composed of 101 places in 301 ms of which 0 ms to minimize.
[2022-05-19 14:22:15] [INFO ] Deduced a trap composed of 85 places in 304 ms of which 1 ms to minimize.
[2022-05-19 14:22:16] [INFO ] Deduced a trap composed of 117 places in 278 ms of which 1 ms to minimize.
[2022-05-19 14:22:16] [INFO ] Deduced a trap composed of 109 places in 285 ms of which 1 ms to minimize.
[2022-05-19 14:22:16] [INFO ] Deduced a trap composed of 101 places in 306 ms of which 1 ms to minimize.
[2022-05-19 14:22:17] [INFO ] Deduced a trap composed of 109 places in 283 ms of which 1 ms to minimize.
[2022-05-19 14:22:17] [INFO ] Deduced a trap composed of 109 places in 308 ms of which 1 ms to minimize.
[2022-05-19 14:22:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:22:17] [INFO ] After 25109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 34 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 32 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2022-05-19 14:22:17] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:22:17] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:22:18] [INFO ] Implicit Places using invariants in 673 ms returned []
[2022-05-19 14:22:18] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:22:18] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 14:22:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:22:25] [INFO ] Implicit Places using invariants and state equation in 6992 ms returned []
Implicit Place search using SMT with State Equation took 7667 ms to find 0 implicit places.
[2022-05-19 14:22:25] [INFO ] Redundant transitions in 85 ms returned []
[2022-05-19 14:22:25] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:22:25] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:22:26] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 136 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1230 rows 568 cols
[2022-05-19 14:22:26] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:22:26] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:22:26] [INFO ] [Nat]Absence check using 62 positive place invariants in 16 ms returned sat
[2022-05-19 14:22:26] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 24 ms returned sat
[2022-05-19 14:22:27] [INFO ] After 1084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:22:27] [INFO ] Deduced a trap composed of 123 places in 246 ms of which 0 ms to minimize.
[2022-05-19 14:22:28] [INFO ] Deduced a trap composed of 139 places in 253 ms of which 0 ms to minimize.
[2022-05-19 14:22:28] [INFO ] Deduced a trap composed of 246 places in 252 ms of which 1 ms to minimize.
[2022-05-19 14:22:28] [INFO ] Deduced a trap composed of 115 places in 242 ms of which 1 ms to minimize.
[2022-05-19 14:22:29] [INFO ] Deduced a trap composed of 131 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:22:29] [INFO ] Deduced a trap composed of 115 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:22:29] [INFO ] Deduced a trap composed of 204 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:22:30] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:22:30] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:22:30] [INFO ] Deduced a trap composed of 139 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:22:30] [INFO ] Deduced a trap composed of 216 places in 240 ms of which 0 ms to minimize.
[2022-05-19 14:22:31] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:22:31] [INFO ] Deduced a trap composed of 99 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:22:31] [INFO ] Deduced a trap composed of 115 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:22:31] [INFO ] Deduced a trap composed of 254 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:22:32] [INFO ] Deduced a trap composed of 115 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:22:32] [INFO ] Deduced a trap composed of 99 places in 263 ms of which 0 ms to minimize.
[2022-05-19 14:22:32] [INFO ] Deduced a trap composed of 115 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:22:33] [INFO ] Deduced a trap composed of 131 places in 253 ms of which 0 ms to minimize.
[2022-05-19 14:22:33] [INFO ] Deduced a trap composed of 107 places in 262 ms of which 1 ms to minimize.
[2022-05-19 14:22:33] [INFO ] Deduced a trap composed of 242 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:22:34] [INFO ] Deduced a trap composed of 254 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:22:34] [INFO ] Deduced a trap composed of 258 places in 263 ms of which 1 ms to minimize.
[2022-05-19 14:22:34] [INFO ] Deduced a trap composed of 107 places in 255 ms of which 1 ms to minimize.
[2022-05-19 14:22:34] [INFO ] Deduced a trap composed of 107 places in 249 ms of which 0 ms to minimize.
[2022-05-19 14:22:35] [INFO ] Deduced a trap composed of 107 places in 251 ms of which 0 ms to minimize.
[2022-05-19 14:22:35] [INFO ] Deduced a trap composed of 204 places in 260 ms of which 0 ms to minimize.
[2022-05-19 14:22:35] [INFO ] Deduced a trap composed of 254 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:22:36] [INFO ] Deduced a trap composed of 107 places in 259 ms of which 0 ms to minimize.
[2022-05-19 14:22:36] [INFO ] Deduced a trap composed of 210 places in 270 ms of which 0 ms to minimize.
[2022-05-19 14:22:36] [INFO ] Deduced a trap composed of 107 places in 262 ms of which 0 ms to minimize.
[2022-05-19 14:22:37] [INFO ] Deduced a trap composed of 123 places in 264 ms of which 1 ms to minimize.
[2022-05-19 14:22:37] [INFO ] Deduced a trap composed of 131 places in 264 ms of which 1 ms to minimize.
[2022-05-19 14:22:37] [INFO ] Deduced a trap composed of 99 places in 279 ms of which 1 ms to minimize.
[2022-05-19 14:22:38] [INFO ] Deduced a trap composed of 258 places in 266 ms of which 1 ms to minimize.
[2022-05-19 14:22:38] [INFO ] Deduced a trap composed of 131 places in 262 ms of which 1 ms to minimize.
[2022-05-19 14:22:38] [INFO ] Deduced a trap composed of 254 places in 260 ms of which 1 ms to minimize.
[2022-05-19 14:22:38] [INFO ] Deduced a trap composed of 123 places in 265 ms of which 0 ms to minimize.
[2022-05-19 14:22:39] [INFO ] Deduced a trap composed of 107 places in 268 ms of which 0 ms to minimize.
[2022-05-19 14:22:39] [INFO ] Deduced a trap composed of 115 places in 260 ms of which 1 ms to minimize.
[2022-05-19 14:22:39] [INFO ] Deduced a trap composed of 123 places in 267 ms of which 1 ms to minimize.
[2022-05-19 14:22:40] [INFO ] Deduced a trap composed of 115 places in 276 ms of which 0 ms to minimize.
[2022-05-19 14:22:40] [INFO ] Deduced a trap composed of 123 places in 263 ms of which 1 ms to minimize.
[2022-05-19 14:22:40] [INFO ] Deduced a trap composed of 242 places in 275 ms of which 1 ms to minimize.
[2022-05-19 14:22:41] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 0 ms to minimize.
[2022-05-19 14:22:41] [INFO ] Deduced a trap composed of 115 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:22:41] [INFO ] Deduced a trap composed of 107 places in 249 ms of which 0 ms to minimize.
[2022-05-19 14:22:42] [INFO ] Deduced a trap composed of 107 places in 265 ms of which 0 ms to minimize.
[2022-05-19 14:22:42] [INFO ] Deduced a trap composed of 246 places in 252 ms of which 1 ms to minimize.
[2022-05-19 14:22:42] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2022-05-19 14:22:42] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:22:43] [INFO ] Deduced a trap composed of 107 places in 257 ms of which 0 ms to minimize.
[2022-05-19 14:22:43] [INFO ] Deduced a trap composed of 107 places in 243 ms of which 0 ms to minimize.
[2022-05-19 14:22:43] [INFO ] Deduced a trap composed of 258 places in 253 ms of which 0 ms to minimize.
[2022-05-19 14:22:44] [INFO ] Deduced a trap composed of 226 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:22:44] [INFO ] Deduced a trap composed of 246 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:22:44] [INFO ] Deduced a trap composed of 115 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:22:44] [INFO ] Deduced a trap composed of 99 places in 255 ms of which 0 ms to minimize.
[2022-05-19 14:22:45] [INFO ] Deduced a trap composed of 131 places in 255 ms of which 1 ms to minimize.
[2022-05-19 14:22:45] [INFO ] Deduced a trap composed of 131 places in 247 ms of which 1 ms to minimize.
[2022-05-19 14:22:45] [INFO ] Deduced a trap composed of 131 places in 248 ms of which 1 ms to minimize.
[2022-05-19 14:22:46] [INFO ] Deduced a trap composed of 107 places in 249 ms of which 1 ms to minimize.
[2022-05-19 14:22:46] [INFO ] Deduced a trap composed of 115 places in 264 ms of which 1 ms to minimize.
[2022-05-19 14:22:46] [INFO ] Deduced a trap composed of 155 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:22:47] [INFO ] Deduced a trap composed of 123 places in 272 ms of which 1 ms to minimize.
[2022-05-19 14:22:47] [INFO ] Deduced a trap composed of 107 places in 266 ms of which 1 ms to minimize.
[2022-05-19 14:22:47] [INFO ] Deduced a trap composed of 99 places in 263 ms of which 0 ms to minimize.
[2022-05-19 14:22:48] [INFO ] Deduced a trap composed of 107 places in 261 ms of which 1 ms to minimize.
[2022-05-19 14:22:48] [INFO ] Deduced a trap composed of 115 places in 263 ms of which 0 ms to minimize.
[2022-05-19 14:22:48] [INFO ] Deduced a trap composed of 115 places in 245 ms of which 1 ms to minimize.
[2022-05-19 14:22:48] [INFO ] Deduced a trap composed of 254 places in 261 ms of which 0 ms to minimize.
[2022-05-19 14:22:49] [INFO ] Deduced a trap composed of 123 places in 249 ms of which 1 ms to minimize.
[2022-05-19 14:22:49] [INFO ] Deduced a trap composed of 123 places in 260 ms of which 1 ms to minimize.
[2022-05-19 14:22:49] [INFO ] Deduced a trap composed of 123 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:22:50] [INFO ] Deduced a trap composed of 123 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:22:50] [INFO ] Deduced a trap composed of 123 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:22:50] [INFO ] Deduced a trap composed of 115 places in 257 ms of which 1 ms to minimize.
[2022-05-19 14:22:50] [INFO ] Deduced a trap composed of 107 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:22:51] [INFO ] Deduced a trap composed of 99 places in 243 ms of which 0 ms to minimize.
[2022-05-19 14:22:51] [INFO ] Deduced a trap composed of 115 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:22:51] [INFO ] Deduced a trap composed of 115 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:22:52] [INFO ] Deduced a trap composed of 107 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:22:52] [INFO ] Deduced a trap composed of 115 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:22:52] [INFO ] Deduced a trap composed of 115 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:22:53] [INFO ] Deduced a trap composed of 115 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:22:53] [INFO ] Deduced a trap composed of 131 places in 242 ms of which 1 ms to minimize.
[2022-05-19 14:22:53] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:22:53] [INFO ] Deduced a trap composed of 254 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:22:54] [INFO ] Deduced a trap composed of 115 places in 252 ms of which 0 ms to minimize.
[2022-05-19 14:22:54] [INFO ] Deduced a trap composed of 123 places in 254 ms of which 1 ms to minimize.
[2022-05-19 14:22:54] [INFO ] Deduced a trap composed of 123 places in 241 ms of which 0 ms to minimize.
[2022-05-19 14:22:55] [INFO ] Deduced a trap composed of 254 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:22:55] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 0 ms to minimize.
[2022-05-19 14:22:55] [INFO ] Deduced a trap composed of 123 places in 253 ms of which 1 ms to minimize.
[2022-05-19 14:22:55] [INFO ] Deduced a trap composed of 258 places in 261 ms of which 0 ms to minimize.
[2022-05-19 14:22:56] [INFO ] Deduced a trap composed of 107 places in 257 ms of which 0 ms to minimize.
[2022-05-19 14:22:56] [INFO ] Deduced a trap composed of 123 places in 257 ms of which 0 ms to minimize.
[2022-05-19 14:22:56] [INFO ] Deduced a trap composed of 107 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:22:57] [INFO ] Deduced a trap composed of 115 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:22:57] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 0 ms to minimize.
[2022-05-19 14:22:57] [INFO ] Deduced a trap composed of 123 places in 264 ms of which 1 ms to minimize.
[2022-05-19 14:22:58] [INFO ] Deduced a trap composed of 246 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:22:58] [INFO ] Deduced a trap composed of 123 places in 258 ms of which 0 ms to minimize.
[2022-05-19 14:22:58] [INFO ] Deduced a trap composed of 123 places in 257 ms of which 0 ms to minimize.
[2022-05-19 14:22:59] [INFO ] Deduced a trap composed of 131 places in 262 ms of which 1 ms to minimize.
[2022-05-19 14:22:59] [INFO ] Deduced a trap composed of 115 places in 251 ms of which 0 ms to minimize.
[2022-05-19 14:22:59] [INFO ] Deduced a trap composed of 131 places in 265 ms of which 0 ms to minimize.
[2022-05-19 14:23:00] [INFO ] Deduced a trap composed of 258 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:23:00] [INFO ] Deduced a trap composed of 246 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:23:00] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2022-05-19 14:23:01] [INFO ] Deduced a trap composed of 107 places in 260 ms of which 1 ms to minimize.
[2022-05-19 14:23:01] [INFO ] Deduced a trap composed of 131 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:23:01] [INFO ] Deduced a trap composed of 115 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:23:02] [INFO ] Deduced a trap composed of 250 places in 253 ms of which 1 ms to minimize.
[2022-05-19 14:23:02] [INFO ] Deduced a trap composed of 100 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:23:02] [INFO ] Deduced a trap composed of 246 places in 248 ms of which 1 ms to minimize.
[2022-05-19 14:23:03] [INFO ] Deduced a trap composed of 131 places in 245 ms of which 0 ms to minimize.
[2022-05-19 14:23:03] [INFO ] Deduced a trap composed of 115 places in 260 ms of which 0 ms to minimize.
[2022-05-19 14:23:08] [INFO ] Deduced a trap composed of 115 places in 255 ms of which 0 ms to minimize.
[2022-05-19 14:23:08] [INFO ] Deduced a trap composed of 123 places in 252 ms of which 1 ms to minimize.
[2022-05-19 14:23:08] [INFO ] Deduced a trap composed of 107 places in 259 ms of which 0 ms to minimize.
[2022-05-19 14:23:09] [INFO ] Deduced a trap composed of 115 places in 263 ms of which 0 ms to minimize.
[2022-05-19 14:23:09] [INFO ] Deduced a trap composed of 99 places in 251 ms of which 0 ms to minimize.
[2022-05-19 14:23:09] [INFO ] Deduced a trap composed of 242 places in 274 ms of which 1 ms to minimize.
[2022-05-19 14:23:10] [INFO ] Deduced a trap composed of 115 places in 268 ms of which 0 ms to minimize.
[2022-05-19 14:23:10] [INFO ] Deduced a trap composed of 107 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:23:11] [INFO ] Deduced a trap composed of 115 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:23:11] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2022-05-19 14:23:20] [INFO ] Trap strengthening (SAT) tested/added 128/128 trap constraints in 52862 ms
[2022-05-19 14:23:22] [INFO ] Deduced a trap composed of 227 places in 269 ms of which 2 ms to minimize.
[2022-05-19 14:23:22] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 1 ms to minimize.
[2022-05-19 14:23:23] [INFO ] Deduced a trap composed of 225 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:23:23] [INFO ] Deduced a trap composed of 228 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:23:23] [INFO ] Deduced a trap composed of 224 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:23:24] [INFO ] Deduced a trap composed of 218 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:23:24] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:23:24] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:23:24] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:23:25] [INFO ] Deduced a trap composed of 206 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:23:25] [INFO ] Deduced a trap composed of 218 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:23:25] [INFO ] Deduced a trap composed of 235 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:23:26] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:23:26] [INFO ] Deduced a trap composed of 224 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:23:26] [INFO ] Deduced a trap composed of 248 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:23:27] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:23:27] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 0 ms to minimize.
[2022-05-19 14:23:27] [INFO ] Deduced a trap composed of 235 places in 255 ms of which 0 ms to minimize.
[2022-05-19 14:23:28] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 1 ms to minimize.
[2022-05-19 14:23:29] [INFO ] Deduced a trap composed of 247 places in 253 ms of which 0 ms to minimize.
[2022-05-19 14:23:29] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:23:29] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 0 ms to minimize.
[2022-05-19 14:23:29] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 1 ms to minimize.
[2022-05-19 14:23:30] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2022-05-19 14:23:30] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 0 ms to minimize.
[2022-05-19 14:23:30] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 1 ms to minimize.
[2022-05-19 14:23:31] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 1 ms to minimize.
[2022-05-19 14:23:31] [INFO ] Deduced a trap composed of 224 places in 254 ms of which 0 ms to minimize.
[2022-05-19 14:23:31] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:23:31] [INFO ] Deduced a trap composed of 234 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:23:32] [INFO ] Deduced a trap composed of 241 places in 254 ms of which 1 ms to minimize.
[2022-05-19 14:23:32] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:23:32] [INFO ] Deduced a trap composed of 226 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:23:33] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:23:33] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:23:33] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 0 ms to minimize.
[2022-05-19 14:23:34] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 1 ms to minimize.
[2022-05-19 14:26:11] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 169045 ms
[2022-05-19 14:26:11] [INFO ] After 224878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 14:26:11] [INFO ] After 225018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-19 14:26:11] [INFO ] Flatten gal took : 73 ms
[2022-05-19 14:26:11] [INFO ] Flatten gal took : 69 ms
[2022-05-19 14:26:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality173731172625300297.gal : 38 ms
[2022-05-19 14:26:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9264332336647872503.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11475032252881760128;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality173731172625300297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9264332336647872503.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality9264332336647872503.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :25 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 29
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :29 after 31
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :31 after 36
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :36 after 75
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :75 after 1076
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1076 after 1126
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1126 after 1264
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1264 after 1479
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1479 after 4557
Detected timeout of ITS tools.
[2022-05-19 14:26:26] [INFO ] Flatten gal took : 65 ms
[2022-05-19 14:26:26] [INFO ] Applying decomposition
[2022-05-19 14:26:26] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12079130482124807737.txt' '-o' '/tmp/graph12079130482124807737.bin' '-w' '/tmp/graph12079130482124807737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12079130482124807737.bin' '-l' '-1' '-v' '-w' '/tmp/graph12079130482124807737.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:26:27] [INFO ] Decomposing Gal with order
[2022-05-19 14:26:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:26:27] [INFO ] Removed a total of 95 redundant transitions.
[2022-05-19 14:26:27] [INFO ] Flatten gal took : 248 ms
[2022-05-19 14:26:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 11 ms.
[2022-05-19 14:26:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2540723612873135463.gal : 10 ms
[2022-05-19 14:26:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12965135153361856836.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11475032252881760128;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2540723612873135463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12965135153361856836.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality12965135153361856836.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 399
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :399 after 401
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :401 after 403
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :403 after 405
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :405 after 407
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :407 after 409
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :409 after 413
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :413 after 440
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :440 after 1079
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1079 after 1110
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1110 after 1159
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1159 after 1263
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1263 after 1795
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1795 after 30830
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :30830 after 838905
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :838905 after 1.14927e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15605903648414061883
[2022-05-19 14:26:42] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15605903648414061883
Running compilation step : cd /tmp/ltsmin15605903648414061883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2763 ms.
Running link step : cd /tmp/ltsmin15605903648414061883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15605903648414061883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 53 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 14:26:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2022-05-19 14:26:57] [INFO ] Flatten gal took : 82 ms
[2022-05-19 14:26:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 14:26:58] [INFO ] Flatten gal took : 79 ms
[2022-05-19 14:26:58] [INFO ] Input system was already deterministic with 1325 transitions.
Support contains 361 out of 664 places (down from 412) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Applied a total of 10 rules in 9 ms. Remains 654 /664 variables (removed 10) and now considering 1325/1325 (removed 0) transitions.
[2022-05-19 14:26:58] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 14:26:58] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 14:26:59] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
[2022-05-19 14:26:59] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 14:26:59] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 14:26:59] [INFO ] Implicit Places using invariants in 513 ms returned []
[2022-05-19 14:26:59] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 14:26:59] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 14:27:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:27:04] [INFO ] Implicit Places using invariants and state equation in 4240 ms returned []
Implicit Place search using SMT with State Equation took 4755 ms to find 0 implicit places.
[2022-05-19 14:27:04] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2022-05-19 14:27:04] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:27:05] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1325/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 654/664 places, 1325/1325 transitions.
[2022-05-19 14:27:05] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:27:05] [INFO ] Flatten gal took : 66 ms
[2022-05-19 14:27:05] [INFO ] Input system was already deterministic with 1325 transitions.
[2022-05-19 14:27:05] [INFO ] Flatten gal took : 67 ms
[2022-05-19 14:27:05] [INFO ] Flatten gal took : 65 ms
[2022-05-19 14:27:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality3572740668637764923.gal : 8 ms
[2022-05-19 14:27:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15060032084814725796.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3572740668637764923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15060032084814725796.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:27:35] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:27:35] [INFO ] Applying decomposition
[2022-05-19 14:27:35] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13554574717220751472.txt' '-o' '/tmp/graph13554574717220751472.bin' '-w' '/tmp/graph13554574717220751472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13554574717220751472.bin' '-l' '-1' '-v' '-w' '/tmp/graph13554574717220751472.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:27:36] [INFO ] Decomposing Gal with order
[2022-05-19 14:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:27:36] [INFO ] Removed a total of 1360 redundant transitions.
[2022-05-19 14:27:36] [INFO ] Flatten gal took : 305 ms
[2022-05-19 14:27:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 14 ms.
[2022-05-19 14:27:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality14695886541155774982.gal : 11 ms
[2022-05-19 14:27:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12309186349171975581.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14695886541155774982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12309186349171975581.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 58 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2022-05-19 14:28:06] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:28:06] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:28:07] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
[2022-05-19 14:28:07] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:28:07] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:28:08] [INFO ] Implicit Places using invariants in 705 ms returned []
[2022-05-19 14:28:08] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:28:08] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:28:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:28:17] [INFO ] Implicit Places using invariants and state equation in 9053 ms returned []
Implicit Place search using SMT with State Equation took 9770 ms to find 0 implicit places.
[2022-05-19 14:28:17] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:28:17] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 14:28:18] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/664 places, 1324/1325 transitions.
[2022-05-19 14:28:18] [INFO ] Flatten gal took : 57 ms
[2022-05-19 14:28:18] [INFO ] Flatten gal took : 61 ms
[2022-05-19 14:28:19] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:28:19] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:28:19] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:28:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15763988688231428221.gal : 7 ms
[2022-05-19 14:28:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1509280414575077009.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15763988688231428221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1509280414575077009.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:28:49] [INFO ] Flatten gal took : 139 ms
[2022-05-19 14:28:49] [INFO ] Applying decomposition
[2022-05-19 14:28:49] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4263762651668892626.txt' '-o' '/tmp/graph4263762651668892626.bin' '-w' '/tmp/graph4263762651668892626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4263762651668892626.bin' '-l' '-1' '-v' '-w' '/tmp/graph4263762651668892626.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:28:49] [INFO ] Decomposing Gal with order
[2022-05-19 14:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:28:49] [INFO ] Removed a total of 1521 redundant transitions.
[2022-05-19 14:28:50] [INFO ] Flatten gal took : 169 ms
[2022-05-19 14:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 427 labels/synchronizations in 48 ms.
[2022-05-19 14:28:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality9231021478943729425.gal : 9 ms
[2022-05-19 14:28:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality13394663570454264583.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9231021478943729425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13394663570454264583.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1251
Applied a total of 148 rules in 171 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2022-05-19 14:29:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:29:20] [INFO ] Computed 82 place invariants in 25 ms
[2022-05-19 14:29:21] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
[2022-05-19 14:29:21] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:29:21] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 14:29:21] [INFO ] Implicit Places using invariants in 647 ms returned []
[2022-05-19 14:29:21] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:29:21] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 14:29:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:29:30] [INFO ] Implicit Places using invariants and state equation in 8463 ms returned []
Implicit Place search using SMT with State Equation took 9112 ms to find 0 implicit places.
[2022-05-19 14:29:30] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 14:29:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:29:30] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 14:29:30] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 580/664 places, 1251/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/664 places, 1251/1325 transitions.
[2022-05-19 14:29:31] [INFO ] Flatten gal took : 53 ms
[2022-05-19 14:29:31] [INFO ] Flatten gal took : 57 ms
[2022-05-19 14:29:31] [INFO ] Input system was already deterministic with 1251 transitions.
[2022-05-19 14:29:31] [INFO ] Flatten gal took : 57 ms
[2022-05-19 14:29:31] [INFO ] Flatten gal took : 57 ms
[2022-05-19 14:29:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality13542040425217021423.gal : 6 ms
[2022-05-19 14:29:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8677051201023740906.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13542040425217021423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8677051201023740906.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:30:01] [INFO ] Flatten gal took : 55 ms
[2022-05-19 14:30:01] [INFO ] Applying decomposition
[2022-05-19 14:30:01] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9986996335060097754.txt' '-o' '/tmp/graph9986996335060097754.bin' '-w' '/tmp/graph9986996335060097754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9986996335060097754.bin' '-l' '-1' '-v' '-w' '/tmp/graph9986996335060097754.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:30:01] [INFO ] Decomposing Gal with order
[2022-05-19 14:30:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:30:01] [INFO ] Removed a total of 2596 redundant transitions.
[2022-05-19 14:30:01] [INFO ] Flatten gal took : 174 ms
[2022-05-19 14:30:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 309 labels/synchronizations in 28 ms.
[2022-05-19 14:30:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality6119156706495919269.gal : 6 ms
[2022-05-19 14:30:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14701473350951863737.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6119156706495919269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14701473350951863737.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 34 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2022-05-19 14:30:32] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:30:32] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 14:30:33] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
[2022-05-19 14:30:33] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:30:33] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 14:30:34] [INFO ] Implicit Places using invariants in 730 ms returned []
[2022-05-19 14:30:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:30:34] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 14:30:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:30:42] [INFO ] Implicit Places using invariants and state equation in 8703 ms returned []
Implicit Place search using SMT with State Equation took 9433 ms to find 0 implicit places.
[2022-05-19 14:30:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:30:42] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:30:43] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/664 places, 1324/1325 transitions.
[2022-05-19 14:30:43] [INFO ] Flatten gal took : 55 ms
[2022-05-19 14:30:43] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:30:44] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:30:44] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:30:44] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:30:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality7701553050257449805.gal : 8 ms
[2022-05-19 14:30:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17568450364814068232.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7701553050257449805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17568450364814068232.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:31:14] [INFO ] Flatten gal took : 100 ms
[2022-05-19 14:31:14] [INFO ] Applying decomposition
[2022-05-19 14:31:14] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15185359258226293104.txt' '-o' '/tmp/graph15185359258226293104.bin' '-w' '/tmp/graph15185359258226293104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15185359258226293104.bin' '-l' '-1' '-v' '-w' '/tmp/graph15185359258226293104.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:31:14] [INFO ] Decomposing Gal with order
[2022-05-19 14:31:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:31:14] [INFO ] Removed a total of 983 redundant transitions.
[2022-05-19 14:31:14] [INFO ] Flatten gal took : 128 ms
[2022-05-19 14:31:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 8 ms.
[2022-05-19 14:31:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5000427579583164956.gal : 9 ms
[2022-05-19 14:31:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality17837279341459468754.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5000427579583164956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17837279341459468754.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 30 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2022-05-19 14:31:45] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:31:45] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 14:31:46] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
[2022-05-19 14:31:46] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:31:46] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 14:31:46] [INFO ] Implicit Places using invariants in 689 ms returned []
[2022-05-19 14:31:46] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:31:46] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:31:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:31:54] [INFO ] Implicit Places using invariants and state equation in 7759 ms returned []
Implicit Place search using SMT with State Equation took 8451 ms to find 0 implicit places.
[2022-05-19 14:31:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:31:54] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 14:31:55] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/664 places, 1324/1325 transitions.
[2022-05-19 14:31:55] [INFO ] Flatten gal took : 83 ms
[2022-05-19 14:31:55] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:31:56] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:31:56] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:31:56] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:31:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality11447380162117096116.gal : 5 ms
[2022-05-19 14:31:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality18056332290830802564.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11447380162117096116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18056332290830802564.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:32:26] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:32:26] [INFO ] Applying decomposition
[2022-05-19 14:32:26] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2600717288499125657.txt' '-o' '/tmp/graph2600717288499125657.bin' '-w' '/tmp/graph2600717288499125657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2600717288499125657.bin' '-l' '-1' '-v' '-w' '/tmp/graph2600717288499125657.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:32:26] [INFO ] Decomposing Gal with order
[2022-05-19 14:32:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:32:26] [INFO ] Removed a total of 1001 redundant transitions.
[2022-05-19 14:32:26] [INFO ] Flatten gal took : 108 ms
[2022-05-19 14:32:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 287 labels/synchronizations in 18 ms.
[2022-05-19 14:32:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality18377494303724560139.gal : 14 ms
[2022-05-19 14:32:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9826293568432820556.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18377494303724560139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9826293568432820556.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions 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 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 98 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2022-05-19 14:32:56] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 14:32:56] [INFO ] Computed 82 place invariants in 29 ms
[2022-05-19 14:32:57] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
[2022-05-19 14:32:57] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 14:32:57] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:32:58] [INFO ] Implicit Places using invariants in 663 ms returned []
[2022-05-19 14:32:58] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 14:32:58] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 14:32:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:33:05] [INFO ] Implicit Places using invariants and state equation in 7387 ms returned []
Implicit Place search using SMT with State Equation took 8052 ms to find 0 implicit places.
[2022-05-19 14:33:05] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-19 14:33:05] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 14:33:05] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 14:33:06] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/664 places, 1253/1325 transitions.
[2022-05-19 14:33:06] [INFO ] Flatten gal took : 54 ms
[2022-05-19 14:33:06] [INFO ] Flatten gal took : 57 ms
[2022-05-19 14:33:06] [INFO ] Input system was already deterministic with 1253 transitions.
[2022-05-19 14:33:06] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:33:06] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:33:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14935830436531835009.gal : 6 ms
[2022-05-19 14:33:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6152054069499777651.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14935830436531835009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6152054069499777651.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:33:36] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:33:36] [INFO ] Applying decomposition
[2022-05-19 14:33:36] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11292532405989799684.txt' '-o' '/tmp/graph11292532405989799684.bin' '-w' '/tmp/graph11292532405989799684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11292532405989799684.bin' '-l' '-1' '-v' '-w' '/tmp/graph11292532405989799684.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:33:36] [INFO ] Decomposing Gal with order
[2022-05-19 14:33:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:33:37] [INFO ] Removed a total of 987 redundant transitions.
[2022-05-19 14:33:37] [INFO ] Flatten gal took : 118 ms
[2022-05-19 14:33:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 6 ms.
[2022-05-19 14:33:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality12133632399176694843.gal : 9 ms
[2022-05-19 14:33:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality2685075111164568001.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12133632399176694843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2685075111164568001.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:34:07] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:34:07] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:34:07] [INFO ] Applying decomposition
[2022-05-19 14:34:07] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15862440825872448053.txt' '-o' '/tmp/graph15862440825872448053.bin' '-w' '/tmp/graph15862440825872448053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15862440825872448053.bin' '-l' '-1' '-v' '-w' '/tmp/graph15862440825872448053.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:34:07] [INFO ] Decomposing Gal with order
[2022-05-19 14:34:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:34:08] [INFO ] Removed a total of 1559 redundant transitions.
[2022-05-19 14:34:08] [INFO ] Flatten gal took : 289 ms
[2022-05-19 14:34:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 8 ms.
[2022-05-19 14:34:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7977475878907250843.gal : 24 ms
[2022-05-19 14:34:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality13465879853955208656.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7977475878907250843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13465879853955208656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:58:58] [INFO ] Flatten gal took : 320 ms
[2022-05-19 14:58:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality7921384791976364016.gal : 36 ms
[2022-05-19 14:58:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10915965760137403034.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7921384791976364016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10915965760137403034.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J30, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017300857"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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