Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819411000450.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DoubleExponent-PT-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411000450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:22 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 DoubleExponent-PT-002-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678465477415

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-10 16:24:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 16:24:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:24:40] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-10 16:24:40] [INFO ] Transformed 110 places.
[2023-03-10 16:24:40] [INFO ] Transformed 98 transitions.
[2023-03-10 16:24:40] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 75 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 23 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:24:40] [INFO ] Computed 11 place invariants in 22 ms
[2023-03-10 16:24:41] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-10 16:24:41] [INFO ] Invariant cache hit.
[2023-03-10 16:24:41] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-10 16:24:41] [INFO ] Invariant cache hit.
[2023-03-10 16:24:41] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 106/110 places, 98/98 transitions.
Support contains 75 out of 106 places after structural reductions.
[2023-03-10 16:24:41] [INFO ] Flatten gal took : 51 ms
[2023-03-10 16:24:41] [INFO ] Flatten gal took : 19 ms
[2023-03-10 16:24:41] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 884 ms. (steps per millisecond=11 ) properties (out of 64) seen :29
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
[2023-03-10 16:24:44] [INFO ] Invariant cache hit.
[2023-03-10 16:24:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:24:44] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:24:44] [INFO ] After 80ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:33
[2023-03-10 16:24:44] [INFO ] After 121ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:33
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-10 16:24:44] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:33
[2023-03-10 16:24:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:24:44] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-10 16:24:45] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :24
[2023-03-10 16:24:45] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2023-03-10 16:24:45] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2023-03-10 16:24:45] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2023-03-10 16:24:45] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-10 16:24:45] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2023-03-10 16:24:45] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-10 16:24:45] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-10 16:24:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 470 ms
[2023-03-10 16:24:46] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2023-03-10 16:24:46] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2023-03-10 16:24:46] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2023-03-10 16:24:46] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-10 16:24:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 313 ms
[2023-03-10 16:24:46] [INFO ] After 1588ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :24
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-03-10 16:24:46] [INFO ] After 2255ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :24
Fused 35 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 353 ms.
Support contains 36 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
Graph (complete) has 173 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 104 transition count 92
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 99 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 95 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 21 place count 95 transition count 84
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 91 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 41 place count 85 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 83 transition count 78
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 83 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 82 transition count 77
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 82 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 81 transition count 76
Applied a total of 50 rules in 48 ms. Remains 81 /106 variables (removed 25) and now considering 76/98 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 81/106 places, 76/98 transitions.
Incomplete random walk after 10000 steps, including 510 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 24) seen :14
Incomplete Best-First random walk after 10000 steps, including 413 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 431 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 411 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 419 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 415 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 415 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 421 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 414 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 400 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 422 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 76 rows 81 cols
[2023-03-10 16:24:49] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-10 16:24:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-10 16:24:49] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 16:24:50] [INFO ] After 95ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-10 16:24:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:24:50] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-10 16:24:50] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-10 16:24:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:24:50] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-10 16:24:50] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-10 16:24:50] [INFO ] After 68ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-10 16:24:50] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-10 16:24:50] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2023-03-10 16:24:50] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2023-03-10 16:24:50] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-10 16:24:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 223 ms
[2023-03-10 16:24:50] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-10 16:24:50] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 81 ms.
Support contains 19 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 76/76 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 81 transition count 72
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 77 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 75 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 75 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 73 transition count 68
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 66 transition count 61
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 66 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 65 transition count 60
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 65 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 64 transition count 59
Applied a total of 35 rules in 31 ms. Remains 64 /81 variables (removed 17) and now considering 59/76 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 64/81 places, 59/76 transitions.
Incomplete random walk after 10000 steps, including 725 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 536 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 541 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 548 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 547 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 576 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 536 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 575 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 550 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 561 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 532 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 10) seen :0
Finished probabilistic random walk after 619 steps, run visited all 10 properties in 18 ms. (steps per millisecond=34 )
Probabilistic random walk after 619 steps, saw 320 distinct states, run finished after 19 ms. (steps per millisecond=32 ) properties seen :10
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 16:24:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-10 16:24:52] [INFO ] Flatten gal took : 14 ms
[2023-03-10 16:24:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DoubleExponent-PT-002-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 16:24:52] [INFO ] Flatten gal took : 10 ms
[2023-03-10 16:24:52] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 59 out of 106 places (down from 64) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 48 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 77 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 82 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 63 transition count 55
Applied a total of 83 rules in 21 ms. Remains 63 /106 variables (removed 43) and now considering 55/98 (removed 43) transitions.
// Phase 1: matrix 55 rows 63 cols
[2023-03-10 16:24:52] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:24:52] [INFO ] Implicit Places using invariants in 77 ms returned [41, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/106 places, 55/98 transitions.
Graph (complete) has 140 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 57 transition count 51
Applied a total of 7 rules in 10 ms. Remains 57 /61 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 57 cols
[2023-03-10 16:24:52] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-10 16:24:52] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-10 16:24:52] [INFO ] Invariant cache hit.
[2023-03-10 16:24:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:24:53] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/106 places, 51/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 265 ms. Remains : 57/106 places, 51/98 transitions.
[2023-03-10 16:24:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:24:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:24:53] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-10 16:24:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:24:53] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:24:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2910196013132947291.gal : 2 ms
[2023-03-10 16:24:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2053703165125972117.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2910196013132947291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2053703165125972117.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2147,0.069991,5024,2,1372,5,6974,6,0,282,6886,0


Converting to forward existential form...Done !
original formula: EF(AG((p20<1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p20<1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t7, t12, t17, t19, t20, t22, t24, t25, t26, t27, t29, t31, t34, t36, t38, t39, t4...261
(forward)formula 0,1,0.254551,12140,1,0,139,33217,124,64,1757,19856,130
FORMULA DoubleExponent-PT-002-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:24:53] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:24:53] [INFO ] Implicit Places using invariants in 70 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 8 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:24:53] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:24:53] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-10 16:24:53] [INFO ] Invariant cache hit.
[2023-03-10 16:24:53] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 274 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:24:53] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:24:53] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:24:53] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:24:53] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:24:53] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:24:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17615300754049477414.gal : 3 ms
[2023-03-10 16:24:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16061997391599918729.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17615300754049477414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16061997391599918729.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.142374,8204,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EF(((AX(AG((p6<1))) * EF(((p24>=1)&&(p42>=1)))) * ((((p100>=1)||(p102>=1))||((p106<1)||(p49<1))) + (EG(AX((p76>=1))) * ((!(A((p21>=1) U (...227
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!(EX(!(!(E(TRUE U !((p6<1))))))) * E(TRUE U ((p24>=1)&&(p42>=1))))) * (((p100>=1)||(p102>...846
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,1.2581,41412,1,0,204,112656,218,115,3035,64704,237
FORMULA DoubleExponent-PT-002-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:24:55] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:24:55] [INFO ] Implicit Places using invariants in 79 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 104 cols
[2023-03-10 16:24:55] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 16:24:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-10 16:24:55] [INFO ] Invariant cache hit.
[2023-03-10 16:24:55] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 328 ms. Remains : 104/106 places, 97/98 transitions.
[2023-03-10 16:24:55] [INFO ] Flatten gal took : 11 ms
[2023-03-10 16:24:55] [INFO ] Flatten gal took : 11 ms
[2023-03-10 16:24:55] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:24:55] [INFO ] Flatten gal took : 10 ms
[2023-03-10 16:24:55] [INFO ] Flatten gal took : 11 ms
[2023-03-10 16:24:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12142714543211788289.gal : 4 ms
[2023-03-10 16:24:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2915449509448211978.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12142714543211788289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2915449509448211978.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.148944,8484,2,4114,5,19213,6,0,514,16904,0


Converting to forward existential form...Done !
original formula: AF((E(((p39<1) + AX((p41>=1))) U A((!(((p69>=1)&&(p84>=1))) * EG((p27>=1))) U ((EF(((p10>=1)&&(p99>=1))) + ((p104>=1)&&(p37>=1))) + (p2>=...233
=> equivalent forward existential formula: [FwdG(Init,!((E(((p39<1) + !(EX(!((p41>=1))))) U !((E(!(((E(TRUE U ((p10>=1)&&(p99>=1))) + ((p104>=1)&&(p37>=1))...479
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,3.11536,81464,1,0,1063,282580,224,103,3237,245901,1094
FORMULA DoubleExponent-PT-002-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 105 transition count 77
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 85 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 84 transition count 76
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 42 place count 84 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 80 place count 65 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 64 transition count 56
Applied a total of 81 rules in 14 ms. Remains 64 /106 variables (removed 42) and now considering 56/98 (removed 42) transitions.
// Phase 1: matrix 56 rows 64 cols
[2023-03-10 16:24:58] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:24:58] [INFO ] Implicit Places using invariants in 58 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/106 places, 56/98 transitions.
Graph (complete) has 144 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 0 with 2 rules applied. Total rules applied 3 place count 61 transition count 54
Applied a total of 3 rules in 6 ms. Remains 61 /63 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 61 cols
[2023-03-10 16:24:58] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 16:24:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-10 16:24:58] [INFO ] Invariant cache hit.
[2023-03-10 16:24:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:24:58] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 61/106 places, 54/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 231 ms. Remains : 61/106 places, 54/98 transitions.
[2023-03-10 16:24:58] [INFO ] Flatten gal took : 4 ms
[2023-03-10 16:24:58] [INFO ] Flatten gal took : 4 ms
[2023-03-10 16:24:58] [INFO ] Input system was already deterministic with 54 transitions.
[2023-03-10 16:24:58] [INFO ] Flatten gal took : 3 ms
[2023-03-10 16:24:58] [INFO ] Flatten gal took : 4 ms
[2023-03-10 16:24:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14210122440258467162.gal : 5 ms
[2023-03-10 16:24:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5297920374117793330.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14210122440258467162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5297920374117793330.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2324,0.07172,5920,2,1395,5,10244,6,0,301,10170,0


Converting to forward existential form...Done !
original formula: AG(EF(((!(A((p32>=1) U (p94>=1))) + (p94>=1)) + ((p69>=1)&&(p77>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(!((E(!((p94>=1)) U (!((p32>=1)) * !((p94>=1)))) + EG(!((p94>=1)))))) + (p94>=...194
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t7, t12, t17, t19, t23, t24, t26, t28, t29, t30, t31, t33, t35, t39, t41, t44, t4...261
(forward)formula 0,1,1.07952,31708,1,0,721,146716,140,116,1954,131666,727
FORMULA DoubleExponent-PT-002-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:24:59] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:25:00] [INFO ] Implicit Places using invariants in 74 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:25:00] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:25:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-10 16:25:00] [INFO ] Invariant cache hit.
[2023-03-10 16:25:00] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 269 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:25:00] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:00] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:00] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:25:00] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:00] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15169752448264336034.gal : 2 ms
[2023-03-10 16:25:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1907345083872636732.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15169752448264336034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1907345083872636732.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.154408,8204,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EX(EG((((p10<1)||(p28<1)) + (EG((p74>=1)) * AX(((p22<1)||(p30<1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(((p10<1)||(p28<1)) + (EG((p74>=1)) * !(EX(!(((p22<1)||(p30<1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,2.69025,75156,1,0,1118,253977,221,152,2979,222846,1140
FORMULA DoubleExponent-PT-002-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:25:02] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:25:03] [INFO ] Implicit Places using invariants in 311 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 313 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:25:03] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-10 16:25:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-10 16:25:03] [INFO ] Invariant cache hit.
[2023-03-10 16:25:03] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 527 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:25:03] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:03] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:03] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:25:03] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:03] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2601469914523006126.gal : 1 ms
[2023-03-10 16:25:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7505399890048590387.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2601469914523006126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7505399890048590387.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.146577,8208,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: (EF(AG((p105<1))) * EF((((AG((p86>=1)) + ((p22>=1)&&(p37>=1))) + ((p106>=1)&&(p42>=1))) * AX((EX((p65>=1)) + (p91<1))))))
=> equivalent forward existential formula: [((FwdU((Init * E(TRUE U !(E(TRUE U !((p105<1)))))),TRUE) * ((!(E(TRUE U !((p86>=1)))) + ((p22>=1)&&(p37>=1))) +...227
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,2.25242,64624,1,0,285,261658,223,162,3182,161454,349
FORMULA DoubleExponent-PT-002-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:25:05] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:25:05] [INFO ] Implicit Places using invariants in 84 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 86 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:25:05] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:25:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 16:25:06] [INFO ] Invariant cache hit.
[2023-03-10 16:25:06] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:25:06] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:25:06] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:25:06] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:25:06] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:06] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8962757464896084215.gal : 1 ms
[2023-03-10 16:25:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9433178152871292050.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8962757464896084215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9433178152871292050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.247979,8204,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: A(E((AX((((p103>=1)&&(p7>=1))||(p98>=1))) + EG((AG(((p56>=1)&&(p75>=1))) + (p74<1)))) U AX(EX((p94<1)))) U ((p43>=1)&&(p9>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((p43>=1)&&(p9>=1)))))) * !(E(!(((p43>=1)&&(p9>=1))) U (!(E((!(EX(!((((p103>=1)&&(p7>=1))||(p98...284
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,5.59146,144556,1,0,1615,759874,233,492,3119,643725,1786
FORMULA DoubleExponent-PT-002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:25:11] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:25:11] [INFO ] Implicit Places using invariants in 63 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 6 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:25:11] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-10 16:25:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-10 16:25:11] [INFO ] Invariant cache hit.
[2023-03-10 16:25:12] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:25:12] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:25:12] [INFO ] Flatten gal took : 9 ms
[2023-03-10 16:25:12] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:25:12] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:25:12] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:25:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9347926807531603231.gal : 2 ms
[2023-03-10 16:25:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10226521603080201553.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9347926807531603231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10226521603080201553.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.148195,8208,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: AX(EG(E(AF(!(((p22>=1)&&(p37>=1)))) U (AX(((p106>=1)&&(p42>=1))) + ((p12>=1)&&(p52>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(!(EG(!(!(((p22>=1)&&(p37>=1)))))) U (!(EX(!(((p106>=1)&&(p42>=1))))) + ((p12>=1)&&(p52>=1)))...168
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,3.31868,88896,1,0,1092,372120,223,123,3106,296008,1133
FORMULA DoubleExponent-PT-002-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:25:15] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:25:15] [INFO ] Implicit Places using invariants in 80 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:25:15] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-10 16:25:15] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-10 16:25:15] [INFO ] Invariant cache hit.
[2023-03-10 16:25:15] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 298 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:25:15] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:15] [INFO ] Flatten gal took : 4 ms
[2023-03-10 16:25:15] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:25:15] [INFO ] Flatten gal took : 4 ms
[2023-03-10 16:25:15] [INFO ] Flatten gal took : 4 ms
[2023-03-10 16:25:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14627702529444430236.gal : 1 ms
[2023-03-10 16:25:15] [INFO ] Time to serialize properties into /tmp/CTLFireability18142953430222484086.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14627702529444430236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18142953430222484086.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.149092,8204,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: (EX(EF(AX((p47<1)))) * !(A(((!(AX((p45>=1))) + AF((p23>=1))) + AF((p103>=1))) U ((p55>=1)&&(p61>=1)))))
=> equivalent forward existential formula: ([FwdG(((FwdU((Init * EX(E(TRUE U !(EX(!((p47<1))))))),!(((p55>=1)&&(p61>=1)))) * !(((p55>=1)&&(p61>=1)))) * !((...309
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
Hit Full ! (commute/partial/dont) 91/0/6
Hit Full ! (commute/partial/dont) 95/0/2
(forward)formula 0,1,4.59246,117196,1,0,1223,560238,241,198,3342,453932,1272
FORMULA DoubleExponent-PT-002-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:25:20] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:25:20] [INFO ] Implicit Places using invariants in 68 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:25:20] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-10 16:25:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 16:25:20] [INFO ] Invariant cache hit.
[2023-03-10 16:25:20] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 305 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:25:20] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:25:20] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:20] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:25:20] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:20] [INFO ] Flatten gal took : 4 ms
[2023-03-10 16:25:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16410287461264129527.gal : 1 ms
[2023-03-10 16:25:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9990735858237405144.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16410287461264129527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9990735858237405144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.148003,8204,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EG(AF((A(((p74<1)&&((p39>=1)||((p14>=1)&&(p8>=1)))) U (EX((p53>=1)) * (p62>=1))) * ((((p106>=1)&&(p49>=1))||((p107>=1)&&(p83>=1)))||(((p6...194
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!((E(!((EX((p53>=1)) * (p62>=1))) U (!(((p74<1)&&((p39>=1)||((p14>=1)&&(p8>=1))))) * !((EX((p...322
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
dead was empty
(forward)formula 0,0,3.16119,86760,1,0,1079,341035,221,113,3118,267847,1118
FORMULA DoubleExponent-PT-002-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:25:24] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:25:24] [INFO ] Implicit Places using invariants in 83 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:25:24] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:25:24] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-10 16:25:24] [INFO ] Invariant cache hit.
[2023-03-10 16:25:24] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 368 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:25:24] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:25:24] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:24] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:25:24] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:25:24] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:25:24] [INFO ] Time to serialize gal into /tmp/CTLFireability10811139105492807466.gal : 2 ms
[2023-03-10 16:25:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14264475654924598041.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10811139105492807466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14264475654924598041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.236257,8204,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EF((AG((AF((p91>=1)) * (p39<1))) + EG(AX((p38>=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!((p91>=1)))) * (p39<1))))))] != FALSE + [FwdG(FwdU(Init,TRUE),!(EX(!((p...176
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,4.72721,116220,1,0,1228,552743,227,201,3109,453753,1280
FORMULA DoubleExponent-PT-002-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:25:29] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:25:29] [INFO ] Implicit Places using invariants in 97 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 101 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:25:29] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-10 16:25:29] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-10 16:25:29] [INFO ] Invariant cache hit.
[2023-03-10 16:25:29] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 103/106 places, 97/98 transitions.
[2023-03-10 16:25:29] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:25:29] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:25:29] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-10 16:25:29] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:29] [INFO ] Flatten gal took : 5 ms
[2023-03-10 16:25:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10024114613662284724.gal : 2 ms
[2023-03-10 16:25:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17630735282061281378.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10024114613662284724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17630735282061281378.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3708,0.238568,8204,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(((p11>=1)&&(p31>=1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((p11>=1)&&(p31>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,2.08324,54232,1,0,209,195889,216,118,3190,123741,245
FORMULA DoubleExponent-PT-002-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2023-03-10 16:25:31] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:25:31] [INFO ] Flatten gal took : 5 ms
Total runtime 51364 ms.

BK_STOP 1678465532845

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-002"
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-5348"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-002, 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 r133-smll-167819411000450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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