About the Execution of ITS-Tools for DiscoveryGPU-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 908.447 | 148730.00 | 158847.00 | 387.60 | TFFFFTFFFTTTTFTT | normal |
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.r078-tall-165260109800066.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 DiscoveryGPU-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.9K Apr 30 07:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 07:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 07:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 36K May 10 09:33 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 DiscoveryGPU-PT-10a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1652630669636
Running Version 202205111006
[2022-05-15 16:04:30] [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-15 16:04:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:04:30] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2022-05-15 16:04:30] [INFO ] Transformed 103 places.
[2022-05-15 16:04:30] [INFO ] Transformed 141 transitions.
[2022-05-15 16:04:30] [INFO ] Found NUPN structural information;
[2022-05-15 16:04:30] [INFO ] Parsed PT model containing 103 places and 141 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 73 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 140
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 102 transition count 130
Applied a total of 12 rules in 16 ms. Remains 102 /103 variables (removed 1) and now considering 130/141 (removed 11) transitions.
// Phase 1: matrix 130 rows 102 cols
[2022-05-15 16:04:31] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 16:04:31] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 130 rows 102 cols
[2022-05-15 16:04:31] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:04:31] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-05-15 16:04:31] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
// Phase 1: matrix 130 rows 102 cols
[2022-05-15 16:04:31] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:04:31] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/103 places, 130/141 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/103 places, 130/141 transitions.
Support contains 73 out of 102 places after structural reductions.
[2022-05-15 16:04:31] [INFO ] Flatten gal took : 29 ms
[2022-05-15 16:04:31] [INFO ] Flatten gal took : 12 ms
[2022-05-15 16:04:31] [INFO ] Input system was already deterministic with 130 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 88) seen :87
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 130 rows 102 cols
[2022-05-15 16:04:31] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 16:04:31] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 16:04:31] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2022-05-15 16:04:31] [INFO ] Flatten gal took : 18 ms
[2022-05-15 16:04:31] [INFO ] Flatten gal took : 8 ms
[2022-05-15 16:04:31] [INFO ] Input system was already deterministic with 130 transitions.
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 100 edges and 90 vertex of which 70 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Graph (trivial) has 78 edges and 70 vertex of which 38 / 70 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 90
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 44 place count 41 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 52 place count 33 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 33 transition count 55
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 25 transition count 39
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 17 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 17 transition count 23
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 9 transition count 15
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 9 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 9 transition count 14
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 6 transition count 11
Applied a total of 113 rules in 16 ms. Remains 6 /102 variables (removed 96) and now considering 11/130 (removed 119) transitions.
[2022-05-15 16:04:32] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2022-05-15 16:04:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:32] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 16:04:32] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2022-05-15 16:04:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-15 16:04:32] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:04:32] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2022-05-15 16:04:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 6/102 places, 11/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/102 places, 11/130 transitions.
[2022-05-15 16:04:32] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:04:32] [INFO ] Flatten gal took : 0 ms
[2022-05-15 16:04:32] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 49 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
FORMULA DiscoveryGPU-PT-10a-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 86 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 86 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 79 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 79 transition count 107
Applied a total of 46 rules in 15 ms. Remains 79 /102 variables (removed 23) and now considering 107/130 (removed 23) transitions.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:04:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:04:32] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:04:32] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:04:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 16:04:32] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/102 places, 107/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/102 places, 107/130 transitions.
[2022-05-15 16:04:32] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:04:32] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:04:32] [INFO ] Input system was already deterministic with 107 transitions.
[2022-05-15 16:04:32] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:04:32] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5541835259016077090.gal : 2 ms
[2022-05-15 16:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14358530000245496873.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/CTLFireability5541835259016077090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14358530000245496873.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.
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,9.65162e+09,1.02465,42048,2,10921,5,247427,6,0,408,139112,0
Converting to forward existential form...Done !
original formula: (AX(((((p68==1) * EG(((p30==1)&&(p101==1)))) + ((p59==1)&&(p101==1))) + (p3==1))) + AG(AX(((p22==0)||(p101==0)))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !(!(EX(!(((((p68==1) * EG(((p30==1)&&(p101==1)))) + ((p59==1)&&(p101==1))) + (p3==1))))))),TRU...195
Reverse transition relation is NOT exact ! Due to transitions t18, t21, t25, t27, t29, t31, t33, t38, t40, t42, t90, t91, t96, t97, t98, t99, t100, t101, t...283
(forward)formula 0,0,7.36281,231660,1,0,276,1.16834e+06,242,164,2543,1.37418e+06,406
FORMULA DiscoveryGPU-PT-10a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 87 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 87 transition count 115
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 82 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 82 transition count 110
Applied a total of 40 rules in 8 ms. Remains 82 /102 variables (removed 20) and now considering 110/130 (removed 20) transitions.
// Phase 1: matrix 110 rows 82 cols
[2022-05-15 16:04:39] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:04:39] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 110 rows 82 cols
[2022-05-15 16:04:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:04:39] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 16:04:39] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/102 places, 110/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/102 places, 110/130 transitions.
[2022-05-15 16:04:39] [INFO ] Flatten gal took : 11 ms
[2022-05-15 16:04:39] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:04:39] [INFO ] Input system was already deterministic with 110 transitions.
[2022-05-15 16:04:39] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:04:39] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:04:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8124048836917833359.gal : 2 ms
[2022-05-15 16:04:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7832020579197410168.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/CTLFireability8124048836917833359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7832020579197410168.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.
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,1.15368e+10,0.857223,36428,2,8729,5,199464,6,0,422,119810,0
Converting to forward existential form...Done !
original formula: E(AG(EF(((p33==1) * AX(((p92==1)&&(p101==1)))))) U (AG(AF((p8==1))) * (((p34==1) + (A(((p61==1)||(((p6==1)&&(p101==1))&&(p28==1))) U !(((...286
=> equivalent forward existential formula: (([((FwdU(Init,!(E(TRUE U !(E(TRUE U ((p33==1) * !(EX(!(((p92==1)&&(p101==1))))))))))) * !(E(TRUE U !(!(EG(!((p8...783
Reverse transition relation is NOT exact ! Due to transitions t15, t22, t28, t30, t34, t36, t37, t39, t43, t86, t92, t98, t99, t100, t101, t102, t103, t104...286
(forward)formula 0,0,24.6128,713060,1,0,611,3.63767e+06,252,317,2572,5.31157e+06,737
FORMULA DiscoveryGPU-PT-10a-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 88 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 88 transition count 116
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 84 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 84 transition count 112
Applied a total of 36 rules in 15 ms. Remains 84 /102 variables (removed 18) and now considering 112/130 (removed 18) transitions.
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:04] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:05:04] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/102 places, 112/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/102 places, 112/130 transitions.
[2022-05-15 16:05:04] [INFO ] Flatten gal took : 9 ms
[2022-05-15 16:05:04] [INFO ] Flatten gal took : 6 ms
[2022-05-15 16:05:04] [INFO ] Input system was already deterministic with 112 transitions.
[2022-05-15 16:05:04] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:04] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5065210510299540526.gal : 1 ms
[2022-05-15 16:05:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2444816484297754372.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/CTLFireability5065210510299540526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2444816484297754372.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.
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,1.33013e+10,1.10469,40768,2,6737,5,222211,6,0,434,145846,0
Converting to forward existential form...Done !
original formula: ((AG(E(((p13==1)&&(p102==1)) U ((EX(((p78==1)&&(p102==1))) + (p61==1)) + ((p23==1)||(!((p82==1)&&(p101==1))))))) * EF((((p63==1)&&(p102==...270
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(((p13==1)&&(p102==1)) U ((EX(((p78==1)&&(p102==1))) + (p61==1)) + ((p23==1)||(!((p82==...471
Reverse transition relation is NOT exact ! Due to transitions t11, t18, t21, t24, t28, t30, t34, t38, t41, t93, t98, t100, t101, t102, t103, t104, t105, t1...288
(forward)formula 0,0,6.1654,178216,1,0,185,857477,261,125,2690,1.15275e+06,270
FORMULA DiscoveryGPU-PT-10a-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 86 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 86 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 79 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 79 transition count 107
Applied a total of 46 rules in 6 ms. Remains 79 /102 variables (removed 23) and now considering 107/130 (removed 23) transitions.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:11] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 16:05:11] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/102 places, 107/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/102 places, 107/130 transitions.
[2022-05-15 16:05:11] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:05:11] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:11] [INFO ] Input system was already deterministic with 107 transitions.
[2022-05-15 16:05:11] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:11] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:05:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5663052746900108693.gal : 1 ms
[2022-05-15 16:05:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5425526851163188787.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/CTLFireability5663052746900108693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5425526851163188787.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.
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,9.19287e+09,0.558955,26216,2,2638,5,140450,6,0,409,79394,0
Converting to forward existential form...Done !
original formula: AG((EX(AF(EX((p88==0)))) * E(((EG((p28==1)) + A((p1==1) U ((p9==1)&&(p101==1)))) + ((p66==1) + AX((p1==1)))) U AF(!(EG(((p94==1)&&(p102==...164
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(EG(!(EX((p88==0))))))))] = FALSE * [(FwdU(Init,TRUE) * !(E(((EG((p28==1)) + !((E(!((...338
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t28, t30, t32, t35, t37, t39, t41, t95, t96, t97, t98, t99, t100, t101, t102, t103,...273
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.1325,335664,1,0,851,2.02696e+06,261,456,2522,2.34626e+06,1098
FORMULA DiscoveryGPU-PT-10a-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 86 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 86 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 79 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 79 transition count 107
Applied a total of 46 rules in 16 ms. Remains 79 /102 variables (removed 23) and now considering 107/130 (removed 23) transitions.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:22] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 16:05:22] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:22] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:05:22] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/102 places, 107/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/102 places, 107/130 transitions.
[2022-05-15 16:05:22] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:22] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:22] [INFO ] Input system was already deterministic with 107 transitions.
[2022-05-15 16:05:22] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:22] [INFO ] Flatten gal took : 7 ms
[2022-05-15 16:05:22] [INFO ] Time to serialize gal into /tmp/CTLFireability173825642057539947.gal : 1 ms
[2022-05-15 16:05:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17192732913231910620.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/CTLFireability173825642057539947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17192732913231910620.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.
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,9.19287e+09,0.486226,23280,2,2114,5,123742,6,0,409,68349,0
Converting to forward existential form...Done !
original formula: E(!(EF(!(((((p94==1)&&(p102==1))&&(p91!=1)) + EG(((p37==1)&&(p101==1))))))) U (AX(E(!((((p74==1)&&(p54==1))&&(p102==1))) U ((p5==1)&&(p10...189
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(((((p94==1)&&(p102==1))&&(p91!=1)) + EG(((p37==1)&&(p101==1)))))))) * !(EX(!(E(!((((p7...353
Reverse transition relation is NOT exact ! Due to transitions t26, t28, t30, t32, t34, t35, t37, t39, t41, t95, t96, t97, t98, t99, t100, t101, t102, t103,...273
(forward)formula 0,1,3.4013,117356,1,0,317,649365,252,186,2525,746417,455
FORMULA DiscoveryGPU-PT-10a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 93 transition count 112
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 84 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 28 place count 75 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 37 place count 75 transition count 103
Applied a total of 37 rules in 13 ms. Remains 75 /102 variables (removed 27) and now considering 103/130 (removed 27) transitions.
// Phase 1: matrix 103 rows 75 cols
[2022-05-15 16:05:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:26] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 103 rows 75 cols
[2022-05-15 16:05:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:05:26] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:26] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-15 16:05:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 75 cols
[2022-05-15 16:05:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:26] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 75/102 places, 103/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/102 places, 103/130 transitions.
[2022-05-15 16:05:26] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:05:26] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:26] [INFO ] Input system was already deterministic with 103 transitions.
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
FORMULA DiscoveryGPU-PT-10a-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 87 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 87 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 81 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 81 transition count 109
Applied a total of 42 rules in 8 ms. Remains 81 /102 variables (removed 21) and now considering 109/130 (removed 21) transitions.
// Phase 1: matrix 109 rows 81 cols
[2022-05-15 16:05:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:26] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 109 rows 81 cols
[2022-05-15 16:05:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 16:05:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 81 cols
[2022-05-15 16:05:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:26] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/102 places, 109/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/102 places, 109/130 transitions.
[2022-05-15 16:05:26] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:26] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:26] [INFO ] Input system was already deterministic with 109 transitions.
[2022-05-15 16:05:26] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:26] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16896761831011893326.gal : 1 ms
[2022-05-15 16:05:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14867835256149524848.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/CTLFireability16896761831011893326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14867835256149524848.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.
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,1.06404e+10,0.702237,31720,2,3969,5,165241,6,0,419,100949,0
Converting to forward existential form...Done !
original formula: AG((((p83==0) + ((AF(((p25==0)||(p101==0))) * EF(((p28==0)||(p102==0)))) * (E(((p70==1)&&(p101==1)) U ((p94==1)&&(p102==1))) * ((p8==0)||...240
=> equivalent forward existential formula: ((([FwdG((FwdU(Init,TRUE) * !((p83==0))),!(((p25==0)||(p101==0))))] = FALSE * [((FwdU(Init,TRUE) * !((p83==0))) ...484
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t35, t36, t38, t90, t95, t97, t98, t99, t100, t101, t102, t103, t104...280
(forward)formula 0,0,13.9239,408416,1,0,599,2.21522e+06,242,319,2506,3.01911e+06,719
FORMULA DiscoveryGPU-PT-10a-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 95 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 95 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 88 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 88 transition count 116
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 84 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 84 transition count 112
Applied a total of 36 rules in 15 ms. Remains 84 /102 variables (removed 18) and now considering 112/130 (removed 18) transitions.
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:40] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:05:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 16:05:40] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:40] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 16:05:40] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/102 places, 112/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/102 places, 112/130 transitions.
[2022-05-15 16:05:40] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:05:40] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:40] [INFO ] Input system was already deterministic with 112 transitions.
[2022-05-15 16:05:40] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:40] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2380846707637409396.gal : 1 ms
[2022-05-15 16:05:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11949312148388482787.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/CTLFireability2380846707637409396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11949312148388482787.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.
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,1.28729e+10,0.599017,29100,2,4027,5,164816,6,0,433,86795,0
Converting to forward existential form...Done !
original formula: (E(EG((((p81==1)||((p44==1)&&(p102==1)))||(p28==1))) U ((((((E(((p5==1)&&(p101==1)) U ((p3==1)&&(p102==1))) * (p50==1)) * (p101==1)) + A(...363
=> equivalent forward existential formula: ((([(FwdU(((((FwdU(Init,EG((((p81==1)||((p44==1)&&(p102==1)))||(p28==1)))) * (p16==1)) * ((((p73==1)&&(p102==1))...836
Reverse transition relation is NOT exact ! Due to transitions t6, t20, t23, t27, t31, t33, t35, t38, t42, t99, t100, t101, t102, t103, t104, t105, t106, t1...282
(forward)formula 0,0,14.9938,466596,1,0,916,2.69513e+06,290,457,2695,3.2635e+06,1123
FORMULA DiscoveryGPU-PT-10a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 94 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 94 transition count 117
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 89 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 84 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 84 transition count 112
Applied a total of 21 rules in 19 ms. Remains 84 /102 variables (removed 18) and now considering 112/130 (removed 18) transitions.
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:55] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-15 16:05:55] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-15 16:05:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:05:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:55] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 84/102 places, 112/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/102 places, 112/130 transitions.
[2022-05-15 16:05:55] [INFO ] Flatten gal took : 5 ms
[2022-05-15 16:05:55] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:55] [INFO ] Input system was already deterministic with 112 transitions.
[2022-05-15 16:05:55] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:55] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:05:55] [INFO ] Time to serialize gal into /tmp/CTLFireability562534148874025008.gal : 5 ms
[2022-05-15 16:05:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16935716845622090366.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/CTLFireability562534148874025008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16935716845622090366.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.
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,5.71392e+09,0.227367,14448,2,1633,5,61424,6,0,435,31631,0
Converting to forward existential form...Done !
original formula: E(((EF(!(A(AG(((p39==1)&&(p101==1))) U (p94==1)))) * (p4==1)) * ((p102==1)&&(p0!=1))) U (((EF(((p44==1)||((p42==1)&&(p101==1)))) + E(AG((...419
=> equivalent forward existential formula: ((([(FwdU(FwdU(Init,((E(TRUE U !(!((E(!((p94==1)) U (!(!(E(TRUE U !(((p39==1)&&(p101==1)))))) * !((p94==1)))) + ...1485
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t27, t33, t38, t44, t88, t93, t95, t99, t100, t101, t102, t103, t104, t105, t106, t1...276
(forward)formula 0,1,6.06827,200404,1,0,546,1.12484e+06,262,301,2754,1.3384e+06,677
FORMULA DiscoveryGPU-PT-10a-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 95 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 95 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 89 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 89 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 84 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 84 transition count 112
Applied a total of 36 rules in 4 ms. Remains 84 /102 variables (removed 18) and now considering 112/130 (removed 18) transitions.
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:06:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:06:02] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:06:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:06:02] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 16:06:02] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 84 cols
[2022-05-15 16:06:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:06:02] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/102 places, 112/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/102 places, 112/130 transitions.
[2022-05-15 16:06:02] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:02] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:06:02] [INFO ] Input system was already deterministic with 112 transitions.
[2022-05-15 16:06:02] [INFO ] Flatten gal took : 4 ms
[2022-05-15 16:06:02] [INFO ] Flatten gal took : 8 ms
[2022-05-15 16:06:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13255625451339614231.gal : 2 ms
[2022-05-15 16:06:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10563292943108026330.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/CTLFireability13255625451339614231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10563292943108026330.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.
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,1.28729e+10,0.675898,29840,2,3064,5,152856,6,0,433,102605,0
Converting to forward existential form...Done !
original formula: (!(E(!(AF(((p80==1)&&(p101==1)))) U (((!(EF(((p6==1)&&(p101==1)))) + (EG((p71==1)) * (EX(((p34==1)&&(p102==1))) + (((p47==1)&&(p101==1))&...367
=> equivalent forward existential formula: ([((FwdU(Init,!(!(EG(!(((p80==1)&&(p101==1))))))) * ((!(E(TRUE U ((p6==1)&&(p101==1)))) + (EG((p71==1)) * (EX(((...470
Reverse transition relation is NOT exact ! Due to transitions t15, t18, t23, t27, t31, t35, t37, t40, t42, t99, t100, t101, t102, t103, t104, t105, t106, t...283
(forward)formula 0,1,18.6952,539076,1,0,1128,3.04465e+06,274,600,2694,3.80077e+06,1421
FORMULA DiscoveryGPU-PT-10a-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 93 transition count 112
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 84 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 28 place count 75 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 37 place count 75 transition count 103
Applied a total of 37 rules in 14 ms. Remains 75 /102 variables (removed 27) and now considering 103/130 (removed 27) transitions.
// Phase 1: matrix 103 rows 75 cols
[2022-05-15 16:06:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:06:21] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 103 rows 75 cols
[2022-05-15 16:06:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:06:21] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:06:21] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-15 16:06:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 75 cols
[2022-05-15 16:06:21] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-15 16:06:21] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 75/102 places, 103/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/102 places, 103/130 transitions.
[2022-05-15 16:06:21] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:21] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:21] [INFO ] Input system was already deterministic with 103 transitions.
Finished random walk after 165 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
FORMULA DiscoveryGPU-PT-10a-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 95 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 95 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 88 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 88 transition count 116
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 82 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 82 transition count 110
Applied a total of 40 rules in 2 ms. Remains 82 /102 variables (removed 20) and now considering 110/130 (removed 20) transitions.
// Phase 1: matrix 110 rows 82 cols
[2022-05-15 16:06:21] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:06:21] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 110 rows 82 cols
[2022-05-15 16:06:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:06:21] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 16:06:21] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 82 cols
[2022-05-15 16:06:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:06:21] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/102 places, 110/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/102 places, 110/130 transitions.
[2022-05-15 16:06:21] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:21] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:21] [INFO ] Input system was already deterministic with 110 transitions.
[2022-05-15 16:06:21] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:21] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12712852032884257562.gal : 1 ms
[2022-05-15 16:06:21] [INFO ] Time to serialize properties into /tmp/CTLFireability18097378937301641980.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/CTLFireability12712852032884257562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18097378937301641980.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.
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,1.10066e+10,0.677508,30472,2,3001,5,157166,6,0,423,100669,0
Converting to forward existential form...Done !
original formula: AG((((p61==0) + EF(AG((p31==0)))) + (AX((((p77==0)||(p101==0))||((p60==0)||(p101==0)))) + ((AF(((p63==1)&&(p102==1))) * AG(!(A((p56==1) U...239
=> equivalent forward existential formula: (([FwdG(((FwdU(Init,TRUE) * !(((p61==0) + E(TRUE U !(E(TRUE U !((p31==0)))))))) * !(!(EX(!((((p77==0)||(p101==0)...706
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t33, t35, t36, t38, t42, t97, t98, t99, t100, t101, t102, t103, t104, t105, t1...276
(forward)formula 0,1,12.8035,385108,1,0,614,2.26932e+06,270,338,2626,2.61374e+06,766
FORMULA DiscoveryGPU-PT-10a-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 86 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 86 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 79 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 79 transition count 107
Applied a total of 46 rules in 2 ms. Remains 79 /102 variables (removed 23) and now considering 107/130 (removed 23) transitions.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:06:34] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 16:06:34] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:06:34] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:06:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 16:06:34] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/102 places, 107/130 transitions.
Applied a total of 0 rules in 0 ms. Remains 78 /78 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/102 places, 107/130 transitions.
[2022-05-15 16:06:34] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:34] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:34] [INFO ] Input system was already deterministic with 107 transitions.
[2022-05-15 16:06:34] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:34] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11460185868252612426.gal : 1 ms
[2022-05-15 16:06:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14210686211541441846.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/CTLFireability11460185868252612426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14210686211541441846.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.
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,9.19287e+09,0.752212,33048,2,6660,5,204680,6,0,407,89757,0
Converting to forward existential form...Done !
original formula: AG(EX((p71==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p71==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t30, t32, t34, t35, t37, t39, t41, t95, t96, t97, t98, t99, t100, t101, t102, t103,...273
(forward)formula 0,0,2.91464,89068,1,0,152,418654,230,101,2325,555879,221
FORMULA DiscoveryGPU-PT-10a-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 93 transition count 114
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 86 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 79 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 79 transition count 107
Applied a total of 29 rules in 8 ms. Remains 79 /102 variables (removed 23) and now considering 107/130 (removed 23) transitions.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:06:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:06:37] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:06:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:06:37] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-15 16:06:37] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-15 16:06:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:06:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/102 places, 107/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/102 places, 107/130 transitions.
[2022-05-15 16:06:37] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:37] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:37] [INFO ] Input system was already deterministic with 107 transitions.
[2022-05-15 16:06:37] [INFO ] Flatten gal took : 2 ms
[2022-05-15 16:06:37] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9693312169311361720.gal : 0 ms
[2022-05-15 16:06:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3853735754656166432.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/CTLFireability9693312169311361720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3853735754656166432.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.
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,3.74866e+09,0.360839,18904,2,2212,5,87834,6,0,411,47571,0
Converting to forward existential form...Done !
original formula: EF((((p52==1)&&(p101==1)) + (EF((((p66==1)&&(p73==1))&&(p102==1))) * AG((((p22==1)&&(p101==1)) + EF(((p99==0)||(p101==0))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p52==1)&&(p101==1)))] != FALSE + [((FwdU(Init,TRUE) * E(TRUE U (((p66==1)&&(p73==1))&&(p1...252
(forward)formula 0,1,0.362116,18904,1,0,7,87834,8,1,417,47571,1
FORMULA DiscoveryGPU-PT-10a-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 121
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 85 transition count 113
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 85 transition count 113
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 78 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 78 transition count 106
Applied a total of 48 rules in 3 ms. Remains 78 /102 variables (removed 24) and now considering 106/130 (removed 24) transitions.
// Phase 1: matrix 106 rows 78 cols
[2022-05-15 16:06:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:06:38] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 106 rows 78 cols
[2022-05-15 16:06:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:06:38] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:06:38] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 78 cols
[2022-05-15 16:06:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:06:38] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/102 places, 106/130 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/102 places, 106/130 transitions.
[2022-05-15 16:06:38] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:38] [INFO ] Flatten gal took : 3 ms
[2022-05-15 16:06:38] [INFO ] Input system was already deterministic with 106 transitions.
[2022-05-15 16:06:38] [INFO ] Flatten gal took : 2 ms
[2022-05-15 16:06:38] [INFO ] Flatten gal took : 2 ms
[2022-05-15 16:06:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3049579703486817255.gal : 1 ms
[2022-05-15 16:06:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4374247796528790075.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/CTLFireability3049579703486817255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4374247796528790075.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.
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,9.04371e+09,0.650969,29212,2,3464,5,154467,6,0,405,97403,0
Converting to forward existential form...Done !
original formula: EX(E((EG(!((((p13==1)&&(p102==1))||((p23==1)&&(p102==1))))) + AX(((p38==1)&&(p102==1)))) U EG((((p15==1)&&(p101==1))&&(p29==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),(EG(!((((p13==1)&&(p102==1))||((p23==1)&&(p102==1))))) + !(EX(!(((p38==1)&&(p102==1))))))),(...198
Reverse transition relation is NOT exact ! Due to transitions t15, t18, t21, t25, t27, t29, t31, t35, t38, t40, t42, t95, t96, t97, t98, t99, t100, t101, t...277
Hit Full ! (commute/partial/dont) 52/104/54
(forward)formula 0,1,20.0372,576088,1,0,851,3.16196e+06,249,490,2629,4.09684e+06,980
FORMULA DiscoveryGPU-PT-10a-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2022-05-15 16:06:58] [INFO ] Flatten gal took : 10 ms
[2022-05-15 16:06:58] [INFO ] Flatten gal took : 3 ms
Total runtime 147592 ms.
BK_STOP 1652630818366
--------------------
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="DiscoveryGPU-PT-10a"
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 DiscoveryGPU-PT-10a, 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 r078-tall-165260109800066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10a.tgz
mv DiscoveryGPU-PT-10a 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 '
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 ;