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-165277017300858.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300858
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652970220625

Running Version 202205111006
[2022-05-19 14:23:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 14:23:42] [INFO ] Load time of PNML (sax parser for PT used): 741 ms
[2022-05-19 14:23:42] [INFO ] Transformed 664 places.
[2022-05-19 14:23:42] [INFO ] Transformed 12050 transitions.
[2022-05-19 14:23:42] [INFO ] Parsed PT model containing 664 places and 12050 transitions in 951 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 72 ms.
[2022-05-19 14:23:42] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-19 14:23:42] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-19 14:23:42] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-19 14:23:42] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-19 14:23:42] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 606 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 108 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
[2022-05-19 14:23:43] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2022-05-19 14:23:43] [INFO ] Computed 82 place invariants in 118 ms
[2022-05-19 14:23:44] [INFO ] Dead Transitions using invariants and state equation in 1636 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:23:44] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:23:44] [INFO ] Computed 82 place invariants in 77 ms
[2022-05-19 14:23:44] [INFO ] Implicit Places using invariants in 192 ms returned []
[2022-05-19 14:23:44] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:23:44] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 14:23:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:23:45] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1940 transitions.
Applied a total of 0 rules in 14 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 653/664 places, 1324/1940 transitions.
Support contains 606 out of 653 places after structural reductions.
[2022-05-19 14:23:45] [INFO ] Flatten gal took : 248 ms
[2022-05-19 14:23:46] [INFO ] Flatten gal took : 192 ms
[2022-05-19 14:23:47] [INFO ] Input system was already deterministic with 1324 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 917 ms. (steps per millisecond=10 ) properties (out of 80) seen :5
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 107 ms. (steps per millisecond=9 ) properties (out of 75) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) 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 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 69) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 61) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=5 ) properties (out of 59) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 58) 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 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 58) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :1
Running SMT prover for 32 properties.
[2022-05-19 14:23:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:23:49] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 14:23:53] [INFO ] [Real]Absence check using 62 positive place invariants in 14 ms returned sat
[2022-05-19 14:23:53] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 26 ms returned sat
[2022-05-19 14:23:55] [INFO ] After 2591ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:25
[2022-05-19 14:23:55] [INFO ] [Nat]Absence check using 62 positive place invariants in 31 ms returned sat
[2022-05-19 14:23:55] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 26 ms returned sat
[2022-05-19 14:24:06] [INFO ] After 10068ms SMT Verify possible using state equation in natural domain returned unsat :29 sat :2
[2022-05-19 14:24:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:24:06] [INFO ] After 180ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :29 sat :2
[2022-05-19 14:24:06] [INFO ] Deduced a trap composed of 306 places in 331 ms of which 8 ms to minimize.
[2022-05-19 14:24:07] [INFO ] Deduced a trap composed of 300 places in 313 ms of which 1 ms to minimize.
[2022-05-19 14:24:07] [INFO ] Deduced a trap composed of 312 places in 312 ms of which 1 ms to minimize.
[2022-05-19 14:24:08] [INFO ] Deduced a trap composed of 318 places in 425 ms of which 1 ms to minimize.
[2022-05-19 14:24:08] [INFO ] Deduced a trap composed of 298 places in 336 ms of which 1 ms to minimize.
[2022-05-19 14:24:08] [INFO ] Deduced a trap composed of 312 places in 311 ms of which 0 ms to minimize.
[2022-05-19 14:24:09] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 1 ms to minimize.
[2022-05-19 14:24:09] [INFO ] Deduced a trap composed of 303 places in 332 ms of which 1 ms to minimize.
[2022-05-19 14:24:09] [INFO ] Deduced a trap composed of 308 places in 313 ms of which 1 ms to minimize.
[2022-05-19 14:24:10] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-19 14:24:10] [INFO ] Deduced a trap composed of 312 places in 309 ms of which 1 ms to minimize.
[2022-05-19 14:24:11] [INFO ] Deduced a trap composed of 310 places in 279 ms of which 0 ms to minimize.
[2022-05-19 14:24:11] [INFO ] Deduced a trap composed of 303 places in 327 ms of which 1 ms to minimize.
[2022-05-19 14:24:11] [INFO ] Deduced a trap composed of 301 places in 313 ms of which 0 ms to minimize.
[2022-05-19 14:24:12] [INFO ] Deduced a trap composed of 314 places in 302 ms of which 1 ms to minimize.
[2022-05-19 14:24:13] [INFO ] Deduced a trap composed of 302 places in 285 ms of which 1 ms to minimize.
[2022-05-19 14:24:13] [INFO ] Deduced a trap composed of 314 places in 286 ms of which 1 ms to minimize.
[2022-05-19 14:24:13] [INFO ] Deduced a trap composed of 306 places in 285 ms of which 0 ms to minimize.
[2022-05-19 14:24:14] [INFO ] Deduced a trap composed of 297 places in 305 ms of which 0 ms to minimize.
[2022-05-19 14:24:14] [INFO ] Deduced a trap composed of 313 places in 295 ms of which 1 ms to minimize.
[2022-05-19 14:24:15] [INFO ] Deduced a trap composed of 316 places in 282 ms of which 0 ms to minimize.
[2022-05-19 14:24:15] [INFO ] Deduced a trap composed of 310 places in 290 ms of which 0 ms to minimize.
[2022-05-19 14:24:15] [INFO ] Deduced a trap composed of 306 places in 283 ms of which 0 ms to minimize.
[2022-05-19 14:24:16] [INFO ] Deduced a trap composed of 300 places in 280 ms of which 1 ms to minimize.
[2022-05-19 14:24:16] [INFO ] Deduced a trap composed of 318 places in 282 ms of which 1 ms to minimize.
[2022-05-19 14:24:17] [INFO ] Deduced a trap composed of 316 places in 276 ms of which 0 ms to minimize.
[2022-05-19 14:24:17] [INFO ] Deduced a trap composed of 306 places in 285 ms of which 1 ms to minimize.
[2022-05-19 14:24:17] [INFO ] Deduced a trap composed of 304 places in 278 ms of which 1 ms to minimize.
[2022-05-19 14:24:18] [INFO ] Deduced a trap composed of 302 places in 292 ms of which 1 ms to minimize.
[2022-05-19 14:24:18] [INFO ] Deduced a trap composed of 304 places in 284 ms of which 1 ms to minimize.
[2022-05-19 14:24:19] [INFO ] Deduced a trap composed of 308 places in 301 ms of which 1 ms to minimize.
[2022-05-19 14:24:20] [INFO ] Deduced a trap composed of 302 places in 291 ms of which 0 ms to minimize.
[2022-05-19 14:24:20] [INFO ] Deduced a trap composed of 316 places in 280 ms of which 0 ms to minimize.
[2022-05-19 14:24:20] [INFO ] Deduced a trap composed of 310 places in 304 ms of which 1 ms to minimize.
[2022-05-19 14:24:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:24:20] [INFO ] After 25228ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0 real:25
Fused 32 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 40 out of 653 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
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 32 rules applied. Total rules applied 32 place count 653 transition count 1292
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 621 transition count 1290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 68 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 136 place count 585 transition count 1256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 584 transition count 1255
Applied a total of 138 rules in 207 ms. Remains 584 /653 variables (removed 69) and now considering 1255/1324 (removed 69) transitions.
[2022-05-19 14:24:21] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 14:24:21] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 14:24:21] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/653 places, 1255/1324 transitions.
Incomplete random walk after 10000 steps, including 723 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 229980 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229980 steps, saw 38492 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-19 14:24:25] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 14:24:25] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 14:24:25] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 14:24:25] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 29 ms returned sat
[2022-05-19 14:24:25] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 14:24:25] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 14:24:25] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 28 ms returned sat
[2022-05-19 14:24:35] [INFO ] After 9540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:24:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:24:35] [INFO ] After 188ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 14:24:35] [INFO ] Deduced a trap composed of 229 places in 269 ms of which 0 ms to minimize.
[2022-05-19 14:24:35] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:24:36] [INFO ] Deduced a trap composed of 256 places in 260 ms of which 1 ms to minimize.
[2022-05-19 14:24:36] [INFO ] Deduced a trap composed of 237 places in 297 ms of which 0 ms to minimize.
[2022-05-19 14:24:36] [INFO ] Deduced a trap composed of 237 places in 287 ms of which 0 ms to minimize.
[2022-05-19 14:24:37] [INFO ] Deduced a trap composed of 235 places in 286 ms of which 1 ms to minimize.
[2022-05-19 14:24:37] [INFO ] Deduced a trap composed of 235 places in 258 ms of which 0 ms to minimize.
[2022-05-19 14:24:37] [INFO ] Deduced a trap composed of 233 places in 256 ms of which 0 ms to minimize.
[2022-05-19 14:24:38] [INFO ] Deduced a trap composed of 254 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:24:38] [INFO ] Deduced a trap composed of 237 places in 283 ms of which 0 ms to minimize.
[2022-05-19 14:24:38] [INFO ] Deduced a trap composed of 248 places in 286 ms of which 0 ms to minimize.
[2022-05-19 14:24:39] [INFO ] Deduced a trap composed of 239 places in 290 ms of which 1 ms to minimize.
[2022-05-19 14:24:39] [INFO ] Deduced a trap composed of 231 places in 286 ms of which 1 ms to minimize.
[2022-05-19 14:24:39] [INFO ] Deduced a trap composed of 241 places in 262 ms of which 1 ms to minimize.
[2022-05-19 14:24:40] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 1 ms to minimize.
[2022-05-19 14:24:40] [INFO ] Deduced a trap composed of 247 places in 275 ms of which 0 ms to minimize.
[2022-05-19 14:24:40] [INFO ] Deduced a trap composed of 235 places in 264 ms of which 1 ms to minimize.
[2022-05-19 14:24:41] [INFO ] Deduced a trap composed of 239 places in 267 ms of which 1 ms to minimize.
[2022-05-19 14:24:41] [INFO ] Deduced a trap composed of 227 places in 267 ms of which 0 ms to minimize.
[2022-05-19 14:24:41] [INFO ] Deduced a trap composed of 231 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:24:42] [INFO ] Deduced a trap composed of 235 places in 254 ms of which 1 ms to minimize.
[2022-05-19 14:24:42] [INFO ] Deduced a trap composed of 244 places in 265 ms of which 0 ms to minimize.
[2022-05-19 14:24:43] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 6 ms to minimize.
[2022-05-19 14:24:43] [INFO ] Deduced a trap composed of 245 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:24:43] [INFO ] Deduced a trap composed of 239 places in 259 ms of which 0 ms to minimize.
[2022-05-19 14:24:44] [INFO ] Deduced a trap composed of 231 places in 273 ms of which 1 ms to minimize.
[2022-05-19 14:24:45] [INFO ] Deduced a trap composed of 235 places in 305 ms of which 1 ms to minimize.
[2022-05-19 14:24:45] [INFO ] Deduced a trap composed of 233 places in 262 ms of which 1 ms to minimize.
[2022-05-19 14:24:45] [INFO ] Deduced a trap composed of 235 places in 259 ms of which 1 ms to minimize.
[2022-05-19 14:24:46] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 2 ms to minimize.
[2022-05-19 14:24:46] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 0 ms to minimize.
[2022-05-19 14:24:47] [INFO ] Deduced a trap composed of 233 places in 271 ms of which 6 ms to minimize.
[2022-05-19 14:24:47] [INFO ] Deduced a trap composed of 235 places in 259 ms of which 2 ms to minimize.
[2022-05-19 14:24:48] [INFO ] Deduced a trap composed of 225 places in 256 ms of which 2 ms to minimize.
[2022-05-19 14:24:48] [INFO ] Deduced a trap composed of 229 places in 251 ms of which 1 ms to minimize.
[2022-05-19 14:24:49] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2022-05-19 14:24:50] [INFO ] Deduced a trap composed of 237 places in 276 ms of which 1 ms to minimize.
[2022-05-19 14:24:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:24:50] [INFO ] After 25125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 7 ms.
Support contains 40 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1255/1255 transitions.
Applied a total of 0 rules in 45 ms. Remains 584 /584 variables (removed 0) and now considering 1255/1255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1255/1255 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1255/1255 transitions.
Applied a total of 0 rules in 48 ms. Remains 584 /584 variables (removed 0) and now considering 1255/1255 (removed 0) transitions.
[2022-05-19 14:24:50] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 14:24:50] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 14:24:51] [INFO ] Implicit Places using invariants in 677 ms returned []
[2022-05-19 14:24:51] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 14:24:51] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:25:00] [INFO ] Implicit Places using invariants and state equation in 9130 ms returned []
Implicit Place search using SMT with State Equation took 9813 ms to find 0 implicit places.
[2022-05-19 14:25:00] [INFO ] Redundant transitions in 77 ms returned []
[2022-05-19 14:25:00] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 14:25:00] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 14:25:01] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1255/1255 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 584 transition count 1246
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 584 transition count 1245
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 583 transition count 1245
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 583 transition count 1244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 582 transition count 1244
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 582 transition count 1234
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 572 transition count 1234
Applied a total of 33 rules in 138 ms. Remains 572 /584 variables (removed 12) and now considering 1234/1255 (removed 21) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1234 rows 572 cols
[2022-05-19 14:25:01] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:25:01] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2022-05-19 14:25:01] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-19 14:25:01] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 14:25:02] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2022-05-19 14:25:02] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2022-05-19 14:25:03] [INFO ] After 1545ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-19 14:25:03] [INFO ] Deduced a trap composed of 225 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:25:04] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 1 ms to minimize.
[2022-05-19 14:25:04] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:25:04] [INFO ] Deduced a trap composed of 251 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:25:05] [INFO ] Deduced a trap composed of 229 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:05] [INFO ] Deduced a trap composed of 223 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:25:05] [INFO ] Deduced a trap composed of 223 places in 240 ms of which 0 ms to minimize.
[2022-05-19 14:25:05] [INFO ] Deduced a trap composed of 229 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:25:06] [INFO ] Deduced a trap composed of 257 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:25:06] [INFO ] Deduced a trap composed of 229 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:25:06] [INFO ] Deduced a trap composed of 233 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:25:06] [INFO ] Deduced a trap composed of 225 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:25:07] [INFO ] Deduced a trap composed of 235 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:25:07] [INFO ] Deduced a trap composed of 231 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:25:07] [INFO ] Deduced a trap composed of 207 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:25:08] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:25:08] [INFO ] Deduced a trap composed of 225 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:25:08] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:25:08] [INFO ] Deduced a trap composed of 231 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:25:09] [INFO ] Deduced a trap composed of 205 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:25:09] [INFO ] Deduced a trap composed of 224 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:25:09] [INFO ] Deduced a trap composed of 242 places in 245 ms of which 1 ms to minimize.
[2022-05-19 14:25:10] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:11] [INFO ] Deduced a trap composed of 233 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:25:11] [INFO ] Deduced a trap composed of 250 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:25:11] [INFO ] Deduced a trap composed of 229 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:25:12] [INFO ] Deduced a trap composed of 233 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:25:12] [INFO ] Deduced a trap composed of 245 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:12] [INFO ] Deduced a trap composed of 254 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:13] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 0 ms to minimize.
[2022-05-19 14:25:13] [INFO ] Deduced a trap composed of 231 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:13] [INFO ] Deduced a trap composed of 240 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:13] [INFO ] Deduced a trap composed of 243 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:25:14] [INFO ] Deduced a trap composed of 223 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:25:14] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:25:14] [INFO ] Deduced a trap composed of 239 places in 226 ms of which 1 ms to minimize.
[2022-05-19 14:25:15] [INFO ] Deduced a trap composed of 246 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:25:15] [INFO ] Deduced a trap composed of 258 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:25:15] [INFO ] Deduced a trap composed of 241 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:25:15] [INFO ] Deduced a trap composed of 241 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:25:16] [INFO ] Deduced a trap composed of 229 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:25:16] [INFO ] Deduced a trap composed of 235 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:16] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:16] [INFO ] Deduced a trap composed of 231 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:25:17] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:25:17] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:25:17] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:25:18] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:25:18] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:25:18] [INFO ] Deduced a trap composed of 231 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:25:18] [INFO ] Deduced a trap composed of 227 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:25:19] [INFO ] Deduced a trap composed of 231 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:25:19] [INFO ] Deduced a trap composed of 229 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:25:19] [INFO ] Deduced a trap composed of 229 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:25:20] [INFO ] Deduced a trap composed of 237 places in 226 ms of which 1 ms to minimize.
[2022-05-19 14:25:20] [INFO ] Deduced a trap composed of 235 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:25:20] [INFO ] Deduced a trap composed of 233 places in 244 ms of which 0 ms to minimize.
[2022-05-19 14:25:20] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:25:21] [INFO ] Deduced a trap composed of 237 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:25:21] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:25:21] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:25:22] [INFO ] Deduced a trap composed of 223 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:25:22] [INFO ] Deduced a trap composed of 227 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:25:22] [INFO ] Deduced a trap composed of 231 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:25:23] [INFO ] Deduced a trap composed of 225 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:25:24] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 3 ms to minimize.
[2022-05-19 14:25:24] [INFO ] Deduced a trap composed of 250 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:25:24] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:25:24] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:25:25] [INFO ] Deduced a trap composed of 235 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:25:25] [INFO ] Deduced a trap composed of 227 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:25:25] [INFO ] Deduced a trap composed of 237 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:25:26] [INFO ] Deduced a trap composed of 235 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:25:26] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:25:26] [INFO ] Deduced a trap composed of 225 places in 241 ms of which 1 ms to minimize.
[2022-05-19 14:25:26] [INFO ] Deduced a trap composed of 229 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:25:27] [INFO ] Deduced a trap composed of 225 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:25:27] [INFO ] Deduced a trap composed of 237 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:25:27] [INFO ] Deduced a trap composed of 227 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:25:27] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:25:28] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:25:28] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:25:29] [INFO ] Deduced a trap composed of 235 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:25:29] [INFO ] Deduced a trap composed of 238 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:25:29] [INFO ] Deduced a trap composed of 232 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:25:30] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:25:30] [INFO ] Deduced a trap composed of 241 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:25:31] [INFO ] Deduced a trap composed of 239 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:25:31] [INFO ] Deduced a trap composed of 231 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:25:31] [INFO ] Deduced a trap composed of 245 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:25:32] [INFO ] Deduced a trap composed of 247 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:25:32] [INFO ] Deduced a trap composed of 231 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:25:32] [INFO ] Deduced a trap composed of 231 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:25:33] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:25:33] [INFO ] Deduced a trap composed of 229 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:25:34] [INFO ] Deduced a trap composed of 227 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:25:34] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:25:34] [INFO ] Deduced a trap composed of 237 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:25:34] [INFO ] Deduced a trap composed of 229 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:25:35] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:25:35] [INFO ] Deduced a trap composed of 246 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:25:35] [INFO ] Deduced a trap composed of 231 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:25:36] [INFO ] Deduced a trap composed of 233 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:25:36] [INFO ] Deduced a trap composed of 229 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:25:36] [INFO ] Deduced a trap composed of 233 places in 244 ms of which 0 ms to minimize.
[2022-05-19 14:25:36] [INFO ] Deduced a trap composed of 237 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:37] [INFO ] Deduced a trap composed of 231 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:25:37] [INFO ] Deduced a trap composed of 229 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:25:37] [INFO ] Deduced a trap composed of 231 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:25:38] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:25:38] [INFO ] Deduced a trap composed of 235 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:25:38] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:25:38] [INFO ] Deduced a trap composed of 227 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:25:39] [INFO ] Deduced a trap composed of 233 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:25:39] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:25:39] [INFO ] Deduced a trap composed of 241 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:25:40] [INFO ] Deduced a trap composed of 235 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:25:40] [INFO ] Deduced a trap composed of 231 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:40] [INFO ] Deduced a trap composed of 227 places in 240 ms of which 0 ms to minimize.
[2022-05-19 14:25:40] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:25:41] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:25:41] [INFO ] Deduced a trap composed of 227 places in 241 ms of which 1 ms to minimize.
[2022-05-19 14:25:41] [INFO ] Deduced a trap composed of 229 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:42] [INFO ] Deduced a trap composed of 233 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:42] [INFO ] Deduced a trap composed of 227 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:43] [INFO ] Deduced a trap composed of 235 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:25:44] [INFO ] Deduced a trap composed of 231 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:25:45] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:45] [INFO ] Deduced a trap composed of 234 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:25:45] [INFO ] Deduced a trap composed of 238 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:25:46] [INFO ] Deduced a trap composed of 229 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:25:46] [INFO ] Deduced a trap composed of 233 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:46] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:25:47] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 1 ms to minimize.
[2022-05-19 14:25:47] [INFO ] Deduced a trap composed of 235 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:25:47] [INFO ] Deduced a trap composed of 239 places in 246 ms of which 0 ms to minimize.
[2022-05-19 14:25:47] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:25:48] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:25:48] [INFO ] Deduced a trap composed of 239 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:25:48] [INFO ] Deduced a trap composed of 241 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:25:49] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:25:49] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:25:49] [INFO ] Deduced a trap composed of 229 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:25:50] [INFO ] Deduced a trap composed of 231 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:25:50] [INFO ] Deduced a trap composed of 248 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:25:50] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:25:51] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:25:51] [INFO ] Deduced a trap composed of 235 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:25:51] [INFO ] Deduced a trap composed of 239 places in 243 ms of which 3 ms to minimize.
[2022-05-19 14:25:51] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:25:52] [INFO ] Deduced a trap composed of 235 places in 240 ms of which 1 ms to minimize.
[2022-05-19 14:25:52] [INFO ] Deduced a trap composed of 233 places in 237 ms of which 1 ms to minimize.
[2022-05-19 14:25:52] [INFO ] Deduced a trap composed of 241 places in 253 ms of which 1 ms to minimize.
[2022-05-19 14:25:53] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:25:53] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:25:53] [INFO ] Deduced a trap composed of 253 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:25:53] [INFO ] Deduced a trap composed of 231 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:25:54] [INFO ] Deduced a trap composed of 229 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:25:54] [INFO ] Deduced a trap composed of 231 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:25:54] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:25:55] [INFO ] Deduced a trap composed of 223 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:25:56] [INFO ] Deduced a trap composed of 244 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:25:57] [INFO ] Deduced a trap composed of 246 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:57] [INFO ] Deduced a trap composed of 229 places in 243 ms of which 1 ms to minimize.
[2022-05-19 14:25:58] [INFO ] Deduced a trap composed of 239 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:25:58] [INFO ] Deduced a trap composed of 231 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:25:58] [INFO ] Deduced a trap composed of 229 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:25:59] [INFO ] Deduced a trap composed of 237 places in 238 ms of which 0 ms to minimize.
[2022-05-19 14:25:59] [INFO ] Deduced a trap composed of 232 places in 240 ms of which 0 ms to minimize.
[2022-05-19 14:26:00] [INFO ] Deduced a trap composed of 239 places in 245 ms of which 0 ms to minimize.
[2022-05-19 14:26:00] [INFO ] Deduced a trap composed of 237 places in 241 ms of which 0 ms to minimize.
[2022-05-19 14:26:00] [INFO ] Deduced a trap composed of 229 places in 242 ms of which 1 ms to minimize.
[2022-05-19 14:26:01] [INFO ] Deduced a trap composed of 223 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:26:01] [INFO ] Deduced a trap composed of 225 places in 275 ms of which 0 ms to minimize.
[2022-05-19 14:26:01] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:26:02] [INFO ] Deduced a trap composed of 227 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:26:02] [INFO ] Deduced a trap composed of 231 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:26:02] [INFO ] Deduced a trap composed of 238 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:26:02] [INFO ] Deduced a trap composed of 225 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:26:03] [INFO ] Deduced a trap composed of 235 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:26:03] [INFO ] Deduced a trap composed of 229 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:26:03] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 1 ms to minimize.
[2022-05-19 14:26:03] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 1 ms to minimize.
[2022-05-19 14:26:05] [INFO ] Deduced a trap composed of 227 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:26:05] [INFO ] Deduced a trap composed of 225 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:26:06] [INFO ] Deduced a trap composed of 227 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:26:06] [INFO ] Deduced a trap composed of 223 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:26:06] [INFO ] Deduced a trap composed of 227 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:26:07] [INFO ] Deduced a trap composed of 237 places in 223 ms of which 1 ms to minimize.
[2022-05-19 14:26:07] [INFO ] Deduced a trap composed of 221 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:26:07] [INFO ] Deduced a trap composed of 229 places in 234 ms of which 0 ms to minimize.
[2022-05-19 14:26:08] [INFO ] Deduced a trap composed of 229 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:26:08] [INFO ] Deduced a trap composed of 231 places in 221 ms of which 0 ms to minimize.
[2022-05-19 14:26:08] [INFO ] Deduced a trap composed of 223 places in 233 ms of which 1 ms to minimize.
[2022-05-19 14:26:09] [INFO ] Deduced a trap composed of 225 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:26:09] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 0 ms to minimize.
[2022-05-19 14:26:09] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:26:09] [INFO ] Deduced a trap composed of 229 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:26:10] [INFO ] Deduced a trap composed of 225 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:26:10] [INFO ] Deduced a trap composed of 231 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:26:10] [INFO ] Deduced a trap composed of 231 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:26:11] [INFO ] Deduced a trap composed of 237 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:26:11] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 1 ms to minimize.
[2022-05-19 14:26:12] [INFO ] Deduced a trap composed of 237 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:26:12] [INFO ] Deduced a trap composed of 235 places in 227 ms of which 1 ms to minimize.
[2022-05-19 14:26:12] [INFO ] Deduced a trap composed of 231 places in 226 ms of which 0 ms to minimize.
[2022-05-19 14:26:13] [INFO ] Deduced a trap composed of 237 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:26:13] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 1 ms to minimize.
[2022-05-19 14:26:13] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:26:14] [INFO ] Deduced a trap composed of 227 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:26:14] [INFO ] Deduced a trap composed of 229 places in 231 ms of which 0 ms to minimize.
[2022-05-19 14:26:14] [INFO ] Deduced a trap composed of 235 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:26:14] [INFO ] Deduced a trap composed of 235 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:26:15] [INFO ] Deduced a trap composed of 237 places in 255 ms of which 1 ms to minimize.
[2022-05-19 14:26:15] [INFO ] Deduced a trap composed of 229 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:26:15] [INFO ] Deduced a trap composed of 231 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:26:16] [INFO ] Deduced a trap composed of 223 places in 227 ms of which 0 ms to minimize.
[2022-05-19 14:26:16] [INFO ] Deduced a trap composed of 231 places in 234 ms of which 1 ms to minimize.
[2022-05-19 14:26:16] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:26:16] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 1 ms to minimize.
[2022-05-19 14:26:17] [INFO ] Deduced a trap composed of 239 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:26:17] [INFO ] Deduced a trap composed of 235 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:26:17] [INFO ] Deduced a trap composed of 243 places in 230 ms of which 1 ms to minimize.
[2022-05-19 14:26:18] [INFO ] Deduced a trap composed of 227 places in 232 ms of which 0 ms to minimize.
[2022-05-19 14:26:18] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 0 ms to minimize.
[2022-05-19 14:26:18] [INFO ] Deduced a trap composed of 243 places in 238 ms of which 1 ms to minimize.
[2022-05-19 14:26:18] [INFO ] Deduced a trap composed of 229 places in 235 ms of which 0 ms to minimize.
[2022-05-19 14:26:19] [INFO ] Deduced a trap composed of 241 places in 235 ms of which 1 ms to minimize.
[2022-05-19 14:26:19] [INFO ] Deduced a trap composed of 240 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:26:19] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 1 ms to minimize.
[2022-05-19 14:26:20] [INFO ] Deduced a trap composed of 233 places in 242 ms of which 1 ms to minimize.
[2022-05-19 14:26:20] [INFO ] Deduced a trap composed of 233 places in 242 ms of which 0 ms to minimize.
[2022-05-19 14:26:20] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 1 ms to minimize.
[2022-05-19 14:26:21] [INFO ] Deduced a trap composed of 237 places in 263 ms of which 1 ms to minimize.
[2022-05-19 14:26:21] [INFO ] Deduced a trap composed of 225 places in 239 ms of which 0 ms to minimize.
[2022-05-19 14:26:21] [INFO ] Deduced a trap composed of 231 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:26:21] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 1 ms to minimize.
[2022-05-19 14:26:22] [INFO ] Deduced a trap composed of 233 places in 233 ms of which 0 ms to minimize.
[2022-05-19 14:26:22] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 0 ms to minimize.
[2022-05-19 14:26:22] [INFO ] Deduced a trap composed of 239 places in 228 ms of which 0 ms to minimize.
[2022-05-19 14:26:23] [INFO ] Deduced a trap composed of 241 places in 236 ms of which 0 ms to minimize.
[2022-05-19 14:26:23] [INFO ] Deduced a trap composed of 231 places in 245 ms of which 1 ms to minimize.
[2022-05-19 14:26:23] [INFO ] Deduced a trap composed of 231 places in 244 ms of which 0 ms to minimize.
[2022-05-19 14:26:32] [INFO ] Trap strengthening (SAT) tested/added 243/243 trap constraints in 89252 ms
[2022-05-19 14:26:35] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 0 ms to minimize.
[2022-05-19 14:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2022-05-19 14:26:35] [INFO ] After 93241ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-19 14:26:35] [INFO ] After 93436ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
[2022-05-19 14:26:35] [INFO ] Flatten gal took : 80 ms
[2022-05-19 14:26:35] [INFO ] Flatten gal took : 73 ms
[2022-05-19 14:26:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5764988969999996549.gal : 22 ms
[2022-05-19 14:26:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10534496006361741736.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17924491362078556859;'/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/ReachabilityCardinality5764988969999996549.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10534496006361741736.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/ReachabilityCardinality10534496006361741736.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 27
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :27 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 33
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 45
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :45 after 115
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :115 after 1393
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1393 after 1466
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1466 after 1648
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1648 after 1981
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1981 after 6945
Detected timeout of ITS tools.
[2022-05-19 14:26:50] [INFO ] Flatten gal took : 67 ms
[2022-05-19 14:26:50] [INFO ] Applying decomposition
[2022-05-19 14:26:50] [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/graph13887778414262452460.txt' '-o' '/tmp/graph13887778414262452460.bin' '-w' '/tmp/graph13887778414262452460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13887778414262452460.bin' '-l' '-1' '-v' '-w' '/tmp/graph13887778414262452460.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:26:51] [INFO ] Decomposing Gal with order
[2022-05-19 14:26:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:26:51] [INFO ] Removed a total of 1376 redundant transitions.
[2022-05-19 14:26:51] [INFO ] Flatten gal took : 537 ms
[2022-05-19 14:26:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 631 labels/synchronizations in 59 ms.
[2022-05-19 14:26:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5140562434840334548.gal : 16 ms
[2022-05-19 14:26:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14173435042634887878.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17924491362078556859;'/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/ReachabilityCardinality5140562434840334548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14173435042634887878.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality14173435042634887878.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12450632407081103769
[2022-05-19 14:27:07] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12450632407081103769
Running compilation step : cd /tmp/ltsmin12450632407081103769;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12450632407081103769;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12450632407081103769;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Successfully simplified 30 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 14:27:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2022-05-19 14:27:10] [INFO ] Flatten gal took : 81 ms
[2022-05-19 14:27:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 14:27:10] [INFO ] Flatten gal took : 92 ms
[2022-05-19 14:27:10] [INFO ] Input system was already deterministic with 1324 transitions.
Support contains 532 out of 653 places (down from 536) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 653 transition count 1320
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 649 transition count 1320
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 649 transition count 1285
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 614 transition count 1285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 611 transition count 1282
Applied a total of 84 rules in 82 ms. Remains 611 /653 variables (removed 42) and now considering 1282/1324 (removed 42) transitions.
[2022-05-19 14:27:10] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 14:27:10] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:27:11] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
[2022-05-19 14:27:11] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 14:27:11] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:27:11] [INFO ] Implicit Places using invariants in 487 ms returned []
[2022-05-19 14:27:11] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 14:27:12] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:27:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:27:16] [INFO ] Implicit Places using invariants and state equation in 4144 ms returned []
Implicit Place search using SMT with State Equation took 4633 ms to find 0 implicit places.
[2022-05-19 14:27:16] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-19 14:27:16] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 14:27:16] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:27:16] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 611/653 places, 1282/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 611/653 places, 1282/1324 transitions.
[2022-05-19 14:27:16] [INFO ] Flatten gal took : 66 ms
[2022-05-19 14:27:17] [INFO ] Flatten gal took : 68 ms
[2022-05-19 14:27:17] [INFO ] Input system was already deterministic with 1282 transitions.
Finished random walk after 141 steps, including 9 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
FORMULA PolyORBNT-PT-S10J30-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 19 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 14:27:17] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:27:17] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:27:18] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
[2022-05-19 14:27:18] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:27:18] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:27:18] [INFO ] Implicit Places using invariants in 535 ms returned []
[2022-05-19 14:27:18] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:27:18] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:27:23] [INFO ] Implicit Places using invariants and state equation in 4621 ms returned []
Implicit Place search using SMT with State Equation took 5157 ms to find 0 implicit places.
[2022-05-19 14:27:23] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:27:23] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 14:27:24] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
[2022-05-19 14:27:24] [INFO ] Flatten gal took : 67 ms
[2022-05-19 14:27:24] [INFO ] Flatten gal took : 72 ms
[2022-05-19 14:27:24] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:27:24] [INFO ] Flatten gal took : 69 ms
[2022-05-19 14:27:24] [INFO ] Flatten gal took : 68 ms
[2022-05-19 14:27:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15709000724168493383.gal : 6 ms
[2022-05-19 14:27:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14551058250600920574.ctl : 3 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/CTLFireability15709000724168493383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14551058250600920574.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:27:55] [INFO ] Flatten gal took : 67 ms
[2022-05-19 14:27:55] [INFO ] Applying decomposition
[2022-05-19 14:27:55] [INFO ] Flatten gal took : 103 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/graph17219259999380456307.txt' '-o' '/tmp/graph17219259999380456307.bin' '-w' '/tmp/graph17219259999380456307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17219259999380456307.bin' '-l' '-1' '-v' '-w' '/tmp/graph17219259999380456307.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:27:55] [INFO ] Decomposing Gal with order
[2022-05-19 14:27:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:27:55] [INFO ] Removed a total of 1001 redundant transitions.
[2022-05-19 14:27:55] [INFO ] Flatten gal took : 152 ms
[2022-05-19 14:27:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 287 labels/synchronizations in 36 ms.
[2022-05-19 14:27:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13138786888543903733.gal : 44 ms
[2022-05-19 14:27:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15762965825093940908.ctl : 245 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/CTLFireability13138786888543903733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15762965825093940908.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...255
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 : 653/653 places, 1324/1324 transitions.
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 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 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 70 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 140 place count 583 transition count 1254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1251
Applied a total of 146 rules in 81 ms. Remains 580 /653 variables (removed 73) and now considering 1251/1324 (removed 73) transitions.
[2022-05-19 14:28:26] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:28:26] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:28:26] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
[2022-05-19 14:28:26] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:28:26] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:28:27] [INFO ] Implicit Places using invariants in 623 ms returned []
[2022-05-19 14:28:27] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:28:27] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 14:28:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:28:35] [INFO ] Implicit Places using invariants and state equation in 7814 ms returned []
Implicit Place search using SMT with State Equation took 8437 ms to find 0 implicit places.
[2022-05-19 14:28:35] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-19 14:28:35] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:28:35] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:28:35] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 580/653 places, 1251/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/653 places, 1251/1324 transitions.
[2022-05-19 14:28:35] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:28:36] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:28:36] [INFO ] Input system was already deterministic with 1251 transitions.
[2022-05-19 14:28:36] [INFO ] Flatten gal took : 61 ms
[2022-05-19 14:28:36] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:28:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13913552934327583.gal : 7 ms
[2022-05-19 14:28:36] [INFO ] Time to serialize properties into /tmp/CTLFireability18094509447358481423.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/CTLFireability13913552934327583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18094509447358481423.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...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:29:06] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:29:06] [INFO ] Applying decomposition
[2022-05-19 14:29:06] [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/graph3883786246288896736.txt' '-o' '/tmp/graph3883786246288896736.bin' '-w' '/tmp/graph3883786246288896736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3883786246288896736.bin' '-l' '-1' '-v' '-w' '/tmp/graph3883786246288896736.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:29:06] [INFO ] Decomposing Gal with order
[2022-05-19 14:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:29:06] [INFO ] Removed a total of 989 redundant transitions.
[2022-05-19 14:29:06] [INFO ] Flatten gal took : 121 ms
[2022-05-19 14:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 352 labels/synchronizations in 20 ms.
[2022-05-19 14:29:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6474600857293959787.gal : 9 ms
[2022-05-19 14:29:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5442101094753368883.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/CTLFireability6474600857293959787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5442101094753368883.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...253
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 : 653/653 places, 1324/1324 transitions.
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 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 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 70 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1251
Applied a total of 146 rules in 78 ms. Remains 580 /653 variables (removed 73) and now considering 1251/1324 (removed 73) transitions.
[2022-05-19 14:29:36] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:29:36] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:29:37] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
[2022-05-19 14:29:37] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:29:37] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:29:38] [INFO ] Implicit Places using invariants in 634 ms returned []
[2022-05-19 14:29:38] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:29:38] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 14:29:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:29:46] [INFO ] Implicit Places using invariants and state equation in 8051 ms returned []
Implicit Place search using SMT with State Equation took 8685 ms to find 0 implicit places.
[2022-05-19 14:29:46] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-19 14:29:46] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 14:29:46] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 14:29:47] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 580/653 places, 1251/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/653 places, 1251/1324 transitions.
[2022-05-19 14:29:47] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:29:47] [INFO ] Flatten gal took : 61 ms
[2022-05-19 14:29:47] [INFO ] Input system was already deterministic with 1251 transitions.
Finished random walk after 229 steps, including 18 resets, run visited all 1 properties in 5 ms. (steps per millisecond=45 )
FORMULA PolyORBNT-PT-S10J30-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 12 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 14:29:47] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:29:47] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 14:29:48] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
[2022-05-19 14:29:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:29:48] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:29:49] [INFO ] Implicit Places using invariants in 681 ms returned []
[2022-05-19 14:29:49] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:29:49] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:29:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:29:56] [INFO ] Implicit Places using invariants and state equation in 6970 ms returned []
Implicit Place search using SMT with State Equation took 7652 ms to find 0 implicit places.
[2022-05-19 14:29:56] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:29:56] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 14:29:57] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
[2022-05-19 14:29:57] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:29:57] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:29:57] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:29:57] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:29:57] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:29:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7828606438089644862.gal : 6 ms
[2022-05-19 14:29:57] [INFO ] Time to serialize properties into /tmp/CTLFireability215474954482027757.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/CTLFireability7828606438089644862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability215474954482027757.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...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:30:27] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:30:27] [INFO ] Applying decomposition
[2022-05-19 14:30:27] [INFO ] Flatten gal took : 63 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/graph3425108007504928915.txt' '-o' '/tmp/graph3425108007504928915.bin' '-w' '/tmp/graph3425108007504928915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3425108007504928915.bin' '-l' '-1' '-v' '-w' '/tmp/graph3425108007504928915.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:30:27] [INFO ] Decomposing Gal with order
[2022-05-19 14:30:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:30:27] [INFO ] Removed a total of 1001 redundant transitions.
[2022-05-19 14:30:27] [INFO ] Flatten gal took : 118 ms
[2022-05-19 14:30:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 18 ms.
[2022-05-19 14:30:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7415396367259245200.gal : 10 ms
[2022-05-19 14:30:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3824239347002749554.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/CTLFireability7415396367259245200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3824239347002749554.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...253
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 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 68 place count 619 transition count 1257
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 134 place count 586 transition count 1257
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 140 place count 583 transition count 1254
Applied a total of 140 rules in 79 ms. Remains 583 /653 variables (removed 70) and now considering 1254/1324 (removed 70) transitions.
[2022-05-19 14:30:58] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2022-05-19 14:30:58] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:30:58] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
[2022-05-19 14:30:58] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2022-05-19 14:30:58] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:30:59] [INFO ] Implicit Places using invariants in 558 ms returned []
[2022-05-19 14:30:59] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2022-05-19 14:30:59] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 14:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:31:08] [INFO ] Implicit Places using invariants and state equation in 8958 ms returned []
Implicit Place search using SMT with State Equation took 9517 ms to find 0 implicit places.
[2022-05-19 14:31:08] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-19 14:31:08] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2022-05-19 14:31:08] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 14:31:09] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 583/653 places, 1254/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 583/653 places, 1254/1324 transitions.
[2022-05-19 14:31:09] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:31:09] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:31:09] [INFO ] Input system was already deterministic with 1254 transitions.
[2022-05-19 14:31:09] [INFO ] Flatten gal took : 61 ms
[2022-05-19 14:31:09] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:31:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14531356113250955140.gal : 5 ms
[2022-05-19 14:31:09] [INFO ] Time to serialize properties into /tmp/CTLFireability8881655585713251544.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/CTLFireability14531356113250955140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8881655585713251544.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:39] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:31:39] [INFO ] Applying decomposition
[2022-05-19 14:31:39] [INFO ] Flatten gal took : 64 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/graph17450847748167593346.txt' '-o' '/tmp/graph17450847748167593346.bin' '-w' '/tmp/graph17450847748167593346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17450847748167593346.bin' '-l' '-1' '-v' '-w' '/tmp/graph17450847748167593346.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:31:39] [INFO ] Decomposing Gal with order
[2022-05-19 14:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:31:39] [INFO ] Removed a total of 1007 redundant transitions.
[2022-05-19 14:31:40] [INFO ] Flatten gal took : 112 ms
[2022-05-19 14:31:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 354 labels/synchronizations in 11 ms.
[2022-05-19 14:31:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2661439710192580348.gal : 9 ms
[2022-05-19 14:31:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14222104895782091955.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/CTLFireability2661439710192580348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14222104895782091955.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 LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 17 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 14:32:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:32:10] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:32:11] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
[2022-05-19 14:32:11] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:32:11] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:32:11] [INFO ] Implicit Places using invariants in 662 ms returned []
[2022-05-19 14:32:11] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:32:11] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:32:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:32:20] [INFO ] Implicit Places using invariants and state equation in 8727 ms returned []
Implicit Place search using SMT with State Equation took 9390 ms to find 0 implicit places.
[2022-05-19 14:32:20] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:32:20] [INFO ] Computed 82 place invariants in 25 ms
[2022-05-19 14:32:21] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
[2022-05-19 14:32:21] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:32:21] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:32:21] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:32:22] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:32:22] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:32:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17369919259311527159.gal : 5 ms
[2022-05-19 14:32:22] [INFO ] Time to serialize properties into /tmp/CTLFireability540807363961259150.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/CTLFireability17369919259311527159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability540807363961259150.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...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:32:52] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:32:52] [INFO ] Applying decomposition
[2022-05-19 14:32:52] [INFO ] Flatten gal took : 64 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/graph3494053267343613236.txt' '-o' '/tmp/graph3494053267343613236.bin' '-w' '/tmp/graph3494053267343613236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3494053267343613236.bin' '-l' '-1' '-v' '-w' '/tmp/graph3494053267343613236.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:32:52] [INFO ] Decomposing Gal with order
[2022-05-19 14:32:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:32:52] [INFO ] Removed a total of 1091 redundant transitions.
[2022-05-19 14:32:52] [INFO ] Flatten gal took : 103 ms
[2022-05-19 14:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 9 ms.
[2022-05-19 14:32:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8998031416171402888.gal : 9 ms
[2022-05-19 14:32:52] [INFO ] Time to serialize properties into /tmp/CTLFireability9047904211244893871.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/CTLFireability8998031416171402888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9047904211244893871.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...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 20 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 14:33:22] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:33:22] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 14:33:23] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
[2022-05-19 14:33:23] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:33:23] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 14:33:24] [INFO ] Implicit Places using invariants in 613 ms returned []
[2022-05-19 14:33:24] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:33:24] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:33:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:33:30] [INFO ] Implicit Places using invariants and state equation in 6603 ms returned []
Implicit Place search using SMT with State Equation took 7217 ms to find 0 implicit places.
[2022-05-19 14:33:30] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:33:30] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 14:33:31] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
[2022-05-19 14:33:32] [INFO ] Flatten gal took : 60 ms
[2022-05-19 14:33:32] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:33:32] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:33:32] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:33:32] [INFO ] Flatten gal took : 61 ms
[2022-05-19 14:33:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5063394841800510350.gal : 5 ms
[2022-05-19 14:33:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11598848299838198154.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/CTLFireability5063394841800510350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11598848299838198154.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:02] [INFO ] Flatten gal took : 61 ms
[2022-05-19 14:34:02] [INFO ] Applying decomposition
[2022-05-19 14:34:02] [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/graph8696235138324307798.txt' '-o' '/tmp/graph8696235138324307798.bin' '-w' '/tmp/graph8696235138324307798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8696235138324307798.bin' '-l' '-1' '-v' '-w' '/tmp/graph8696235138324307798.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:34:02] [INFO ] Decomposing Gal with order
[2022-05-19 14:34:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:34:02] [INFO ] Removed a total of 1001 redundant transitions.
[2022-05-19 14:34:02] [INFO ] Flatten gal took : 103 ms
[2022-05-19 14:34:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 287 labels/synchronizations in 12 ms.
[2022-05-19 14:34:02] [INFO ] Time to serialize gal into /tmp/CTLFireability401895632063700780.gal : 8 ms
[2022-05-19 14:34:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4791666560271496603.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/CTLFireability401895632063700780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4791666560271496603.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...252
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 11 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 14:34:32] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:34:32] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 14:34:33] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
[2022-05-19 14:34:33] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:34:33] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 14:34:34] [INFO ] Implicit Places using invariants in 630 ms returned []
[2022-05-19 14:34:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:34:34] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:34:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:34:42] [INFO ] Implicit Places using invariants and state equation in 7466 ms returned []
Implicit Place search using SMT with State Equation took 8097 ms to find 0 implicit places.
[2022-05-19 14:34:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:34:42] [INFO ] Computed 82 place invariants in 26 ms
[2022-05-19 14:34:43] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
[2022-05-19 14:34:43] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:34:43] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:34:43] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:34:43] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:34:43] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:34:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16411766088364666601.gal : 6 ms
[2022-05-19 14:34:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4189344309173998896.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/CTLFireability16411766088364666601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4189344309173998896.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:35:13] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:35:13] [INFO ] Applying decomposition
[2022-05-19 14:35:13] [INFO ] Flatten gal took : 64 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/graph7680537043547774065.txt' '-o' '/tmp/graph7680537043547774065.bin' '-w' '/tmp/graph7680537043547774065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7680537043547774065.bin' '-l' '-1' '-v' '-w' '/tmp/graph7680537043547774065.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:35:13] [INFO ] Decomposing Gal with order
[2022-05-19 14:35:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:35:13] [INFO ] Removed a total of 1001 redundant transitions.
[2022-05-19 14:35:13] [INFO ] Flatten gal took : 113 ms
[2022-05-19 14:35:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 10 ms.
[2022-05-19 14:35:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3351484007051309209.gal : 10 ms
[2022-05-19 14:35:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17725378971542644819.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/CTLFireability3351484007051309209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17725378971542644819.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 LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 11 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 14:35:44] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:35:44] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 14:35:45] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
[2022-05-19 14:35:45] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:35:45] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 14:35:45] [INFO ] Implicit Places using invariants in 659 ms returned []
[2022-05-19 14:35:45] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:35:45] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 14:35:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:35:54] [INFO ] Implicit Places using invariants and state equation in 8576 ms returned []
Implicit Place search using SMT with State Equation took 9237 ms to find 0 implicit places.
[2022-05-19 14:35:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 14:35:54] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 14:35:55] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
[2022-05-19 14:35:55] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:35:55] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:35:55] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:35:55] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:35:55] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:35:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9085505800793704806.gal : 6 ms
[2022-05-19 14:35:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4567065797004991381.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/CTLFireability9085505800793704806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4567065797004991381.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...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 14:36:25] [INFO ] Flatten gal took : 64 ms
[2022-05-19 14:36:25] [INFO ] Applying decomposition
[2022-05-19 14:36:25] [INFO ] Flatten gal took : 64 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/graph14040841436372521220.txt' '-o' '/tmp/graph14040841436372521220.bin' '-w' '/tmp/graph14040841436372521220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14040841436372521220.bin' '-l' '-1' '-v' '-w' '/tmp/graph14040841436372521220.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:36:26] [INFO ] Decomposing Gal with order
[2022-05-19 14:36:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:36:26] [INFO ] Removed a total of 1091 redundant transitions.
[2022-05-19 14:36:26] [INFO ] Flatten gal took : 102 ms
[2022-05-19 14:36:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 6 ms.
[2022-05-19 14:36:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16412135726224880157.gal : 8 ms
[2022-05-19 14:36:26] [INFO ] Time to serialize properties into /tmp/CTLFireability4779344695172613243.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/CTLFireability16412135726224880157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4779344695172613243.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.
[2022-05-19 14:36:56] [INFO ] Flatten gal took : 69 ms
[2022-05-19 14:36:56] [INFO ] Flatten gal took : 70 ms
[2022-05-19 14:36:56] [INFO ] Applying decomposition
[2022-05-19 14:36:56] [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/graph10474778815050629746.txt' '-o' '/tmp/graph10474778815050629746.bin' '-w' '/tmp/graph10474778815050629746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10474778815050629746.bin' '-l' '-1' '-v' '-w' '/tmp/graph10474778815050629746.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:36:56] [INFO ] Decomposing Gal with order
[2022-05-19 14:36:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:36:56] [INFO ] Removed a total of 1001 redundant transitions.
[2022-05-19 14:36:56] [INFO ] Flatten gal took : 112 ms
[2022-05-19 14:36:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 10 ms.
[2022-05-19 14:36:56] [INFO ] Time to serialize gal into /tmp/CTLFireability4383666319513074486.gal : 12 ms
[2022-05-19 14:36:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16932286155674736699.ctl : 4 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/CTLFireability4383666319513074486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16932286155674736699.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2022-05-19 14:47:27] [INFO ] Flatten gal took : 388 ms
[2022-05-19 14:47:27] [INFO ] Time to serialize gal into /tmp/CTLFireability9413773683425921598.gal : 44 ms
[2022-05-19 14:47:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14981595800646841406.ctl : 31 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/CTLFireability9413773683425921598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14981595800646841406.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2022-05-19 14:55:35] [INFO ] Flatten gal took : 297 ms
[2022-05-19 14:55:36] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 14:55:36] [INFO ] Transformed 653 places.
[2022-05-19 14:55:36] [INFO ] Transformed 1324 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 14:56:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9560567277633173695.gal : 8 ms
[2022-05-19 14:56:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17318140939551365612.ctl : 6 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/CTLFireability9560567277633173695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17318140939551365612.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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...320
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2385764 ms.

BK_STOP 1652972608584

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="CTLFireability"
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 CTLFireability"
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-165277017300858"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;