About the Execution of ITS-Tools for IBM5964-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 375.979 | 22509.00 | 48559.00 | 191.70 | TFTFTFFFTFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r202-smll-171649588000338.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is IBM5964-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649588000338
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 16K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 11 18:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 11 18:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 18:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 171K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-00
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-01
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-02
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-03
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-04
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-05
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-06
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-07
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-08
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-09
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-10
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-11
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-12
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-13
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-14
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716777008049
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 02:30:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 02:30:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:30:11] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-05-27 02:30:11] [INFO ] Transformed 263 places.
[2024-05-27 02:30:11] [INFO ] Transformed 139 transitions.
[2024-05-27 02:30:11] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 613 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 50 ms.
Support contains 168 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 34 places
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 220 transition count 139
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 219 transition count 138
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 219 transition count 138
Applied a total of 45 rules in 83 ms. Remains 219 /263 variables (removed 44) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 219 cols
[2024-05-27 02:30:11] [INFO ] Computed 88 invariants in 29 ms
[2024-05-27 02:30:12] [INFO ] Implicit Places using invariants in 475 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 567 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/263 places, 138/139 transitions.
Applied a total of 0 rules in 10 ms. Remains 218 /218 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 713 ms. Remains : 218/263 places, 138/139 transitions.
Support contains 168 out of 218 places after structural reductions.
[2024-05-27 02:30:12] [INFO ] Flatten gal took : 90 ms
[2024-05-27 02:30:12] [INFO ] Flatten gal took : 35 ms
[2024-05-27 02:30:12] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 165 out of 218 places (down from 168) after GAL structural reductions.
RANDOM walk for 40000 steps (853 resets) in 2498 ms. (16 steps per ms) remains 59/71 properties
BEST_FIRST walk for 4002 steps (20 resets) in 110 ms. (36 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (21 resets) in 78 ms. (50 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 60 ms. (65 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (20 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (22 resets) in 56 ms. (70 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 57 ms. (69 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 52 ms. (75 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 48 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 74 ms. (53 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (22 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (22 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (23 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (22 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (22 resets) in 47 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (23 resets) in 48 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 47 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (20 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
// Phase 1: matrix 138 rows 218 cols
[2024-05-27 02:30:14] [INFO ] Computed 87 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 27/173 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 6/179 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 122/301 variables, 179/264 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 8 (OVERLAPS) 46/347 variables, 32/296 constraints. Problems are: Problem set: 18 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/296 constraints. Problems are: Problem set: 18 solved, 41 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
After SMT solving in domain Real declared 356/356 variables, and 303 constraints, problems are : Problem set: 59 solved, 0 unsolved in 3636 ms.
Refiners :[Generalized P Invariants (flows): 85/87 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 3750ms problems are : Problem set: 59 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 59 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IBM5964-PT-none-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:30:18] [INFO ] Flatten gal took : 25 ms
[2024-05-27 02:30:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 02:30:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA IBM5964-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:30:18] [INFO ] Flatten gal took : 23 ms
FORMULA IBM5964-PT-none-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:30:18] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 14 out of 218 places (down from 16) after GAL structural reductions.
Computed a total of 218 stabilizing places and 138 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 218 transition count 138
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
FORMULA IBM5964-PT-none-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 79 places
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 139 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 89 place count 129 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 99 place count 129 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 128 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 128 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 127 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 127 transition count 126
Applied a total of 103 rules in 70 ms. Remains 127 /218 variables (removed 91) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 127 cols
[2024-05-27 02:30:18] [INFO ] Computed 8 invariants in 5 ms
[2024-05-27 02:30:18] [INFO ] Implicit Places using invariants in 107 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/218 places, 126/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 125
Applied a total of 2 rules in 9 ms. Remains 125 /126 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 125 cols
[2024-05-27 02:30:18] [INFO ] Computed 7 invariants in 2 ms
[2024-05-27 02:30:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 02:30:18] [INFO ] Invariant cache hit.
[2024-05-27 02:30:18] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 125/218 places, 125/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 529 ms. Remains : 125/218 places, 125/138 transitions.
[2024-05-27 02:30:18] [INFO ] Flatten gal took : 14 ms
[2024-05-27 02:30:18] [INFO ] Flatten gal took : 14 ms
[2024-05-27 02:30:18] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-27 02:30:18] [INFO ] Flatten gal took : 13 ms
[2024-05-27 02:30:19] [INFO ] Flatten gal took : 13 ms
[2024-05-27 02:30:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13331907188878327719.gal : 8 ms
[2024-05-27 02:30:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4977271657367969987.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13331907188878327719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4977271657367969987.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7899,0.080553,4292,2,404,5,3413,6,0,626,3460,0
Converting to forward existential form...Done !
original formula: A(EG(EF(((((process_s00000383__s00005964_input_s00001609>=1)&&(callToProcess_s00002538_input_s00001011>=1))&&((callToTask_s00005897_outpu...372
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!(EG(E(TRUE U ((((process_s00000383__s00005964_...491
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t23, t46, Intersection with reachable at each step enabled. (destroyed/reverse/inter...180
(forward)formula 0,0,0.282917,10352,1,0,98,23124,175,38,2001,23189,214
FORMULA IBM5964-PT-none-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 24 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 123 cols
[2024-05-27 02:30:19] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 02:30:19] [INFO ] Implicit Places using invariants in 83 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/218 places, 126/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 125
Applied a total of 2 rules in 10 ms. Remains 121 /122 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 121 cols
[2024-05-27 02:30:19] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 02:30:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 02:30:19] [INFO ] Invariant cache hit.
[2024-05-27 02:30:19] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/218 places, 125/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 121/218 places, 125/138 transitions.
[2024-05-27 02:30:19] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:30:19] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:30:19] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-27 02:30:19] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:30:19] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:30:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9968794486670974075.gal : 3 ms
[2024-05-27 02:30:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17766705847384492816.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9968794486670974075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17766705847384492816.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7899,0.04407,4348,2,301,5,3234,6,0,610,3547,0
Converting to forward existential form...Done !
original formula: AF(EX(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t23, t46, Intersection with reachable at each step enabled. (destroyed/reverse/inter...180
(forward)formula 0,1,0.298666,11740,1,0,179,35753,166,113,1857,40278,283
FORMULA IBM5964-PT-none-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 20 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 123 cols
[2024-05-27 02:30:20] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 02:30:20] [INFO ] Implicit Places using invariants in 335 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 338 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/218 places, 126/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 125
Applied a total of 2 rules in 5 ms. Remains 121 /122 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 121 cols
[2024-05-27 02:30:20] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 02:30:20] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 02:30:20] [INFO ] Invariant cache hit.
[2024-05-27 02:30:20] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/218 places, 125/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 666 ms. Remains : 121/218 places, 125/138 transitions.
[2024-05-27 02:30:20] [INFO ] Flatten gal took : 12 ms
[2024-05-27 02:30:20] [INFO ] Flatten gal took : 18 ms
[2024-05-27 02:30:20] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-27 02:30:20] [INFO ] Flatten gal took : 13 ms
[2024-05-27 02:30:20] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:30:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3293699493918083216.gal : 10 ms
[2024-05-27 02:30:20] [INFO ] Time to serialize properties into /tmp/CTLFireability17800317496841872983.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3293699493918083216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17800317496841872983.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7899,0.068623,4344,2,301,5,3234,6,0,610,3547,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.076892,4344,1,0,6,3234,7,1,736,3547,1
FORMULA IBM5964-PT-none-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 81 places
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 137 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 91 place count 127 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 101 place count 127 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 126 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 126 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 125 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 125 transition count 126
Applied a total of 105 rules in 10 ms. Remains 125 /218 variables (removed 93) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 125 cols
[2024-05-27 02:30:21] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 02:30:21] [INFO ] Implicit Places using invariants in 79 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/218 places, 126/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 125
Applied a total of 2 rules in 6 ms. Remains 123 /124 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 123 cols
[2024-05-27 02:30:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 02:30:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 02:30:21] [INFO ] Invariant cache hit.
[2024-05-27 02:30:21] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 123/218 places, 125/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 357 ms. Remains : 123/218 places, 125/138 transitions.
[2024-05-27 02:30:21] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:30:21] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:30:21] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-27 02:30:21] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:30:21] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:30:21] [INFO ] Time to serialize gal into /tmp/CTLFireability785541016207395513.gal : 3 ms
[2024-05-27 02:30:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12582311127649156623.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability785541016207395513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12582311127649156623.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7899,0.061366,4352,2,296,5,2701,6,0,618,2632,0
Converting to forward existential form...Done !
original formula: EF((AX(FALSE) * (((callToTask_s00005897_inputCriterion_s00000937_used<1)||(callToProcess_s00005925_input_s00000952<1))||((callToProcess_s...231
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((callToTask_s00005897_inputCriterion_s00000937_used<1)||(callToProcess_s00005925_input_s0...289
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t23, t46, Intersection with reachable at each step enabled. (destroyed/reverse/inter...180
(forward)formula 0,1,0.181311,7256,1,0,46,5391,162,26,1816,5551,153
FORMULA IBM5964-PT-none-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 9 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 123 cols
[2024-05-27 02:30:21] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 02:30:21] [INFO ] Implicit Places using invariants in 56 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/218 places, 126/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 125
Applied a total of 2 rules in 2 ms. Remains 121 /122 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 121 cols
[2024-05-27 02:30:21] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 02:30:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 02:30:21] [INFO ] Invariant cache hit.
[2024-05-27 02:30:21] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/218 places, 125/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 121/218 places, 125/138 transitions.
[2024-05-27 02:30:21] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:30:21] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:30:21] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-27 02:30:21] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:30:21] [INFO ] Flatten gal took : 13 ms
[2024-05-27 02:30:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6871263008989364728.gal : 2 ms
[2024-05-27 02:30:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2601430495740552728.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6871263008989364728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2601430495740552728.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7899,0.042006,4344,2,301,5,3234,6,0,610,3547,0
Converting to forward existential form...Done !
original formula: AG(AF(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t23, t46, Intersection with reachable at each step enabled. (destroyed/reverse/inter...180
(forward)formula 0,0,0.191032,8832,1,0,87,17559,166,26,1856,17066,199
FORMULA IBM5964-PT-none-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 6 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 123 cols
[2024-05-27 02:30:22] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 02:30:22] [INFO ] Implicit Places using invariants in 79 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/218 places, 126/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 125
Applied a total of 2 rules in 3 ms. Remains 121 /122 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 121 cols
[2024-05-27 02:30:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 02:30:22] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 02:30:22] [INFO ] Invariant cache hit.
[2024-05-27 02:30:22] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/218 places, 125/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 359 ms. Remains : 121/218 places, 125/138 transitions.
[2024-05-27 02:30:22] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:30:22] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:30:22] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-27 02:30:22] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:30:22] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:30:22] [INFO ] Time to serialize gal into /tmp/CTLFireability337042030239473303.gal : 2 ms
[2024-05-27 02:30:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12341015424484974020.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability337042030239473303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12341015424484974020.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7899,0.068801,4344,2,301,5,3234,6,0,610,3547,0
Converting to forward existential form...Done !
original formula: AF((AX(FALSE) + EG((decision_s00001616_activated>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) + EG((decision_s00001616_activated>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t23, t46, Intersection with reachable at each step enabled. (destroyed/reverse/inter...180
dead was empty
(forward)formula 0,1,0.307819,8832,1,0,87,17556,167,28,1856,17116,197
FORMULA IBM5964-PT-none-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 10 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 123 cols
[2024-05-27 02:30:22] [INFO ] Computed 4 invariants in 3 ms
[2024-05-27 02:30:22] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 02:30:22] [INFO ] Invariant cache hit.
[2024-05-27 02:30:23] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-27 02:30:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 4 (OVERLAPS) 126/249 variables, 123/127 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/127 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/127 constraints. Problems are: Problem set: 104 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 127 constraints, problems are : Problem set: 104 solved, 21 unsolved in 2472 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 2/2 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 22/44 variables, 22/24 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 13/37 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 5/49 variables, 3/40 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 8/48 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/48 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 6/55 variables, 3/51 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/51 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 8/63 variables, 4/55 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/63 variables, 0/55 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 8/71 variables, 1/56 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/56 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 8/79 variables, 9/65 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 0/65 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 2/81 variables, 1/66 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/81 variables, 0/66 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 3/84 variables, 1/67 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/84 variables, 0/67 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 6/90 variables, 2/69 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/90 variables, 0/69 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 11/101 variables, 4/73 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/101 variables, 0/73 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 25 (OVERLAPS) 16/117 variables, 7/80 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/117 variables, 0/80 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 27 (OVERLAPS) 13/130 variables, 7/87 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 29 (OVERLAPS) 9/139 variables, 5/92 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/139 variables, 0/92 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 31 (OVERLAPS) 9/148 variables, 4/96 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/148 variables, 0/96 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 33 (OVERLAPS) 11/159 variables, 5/101 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/159 variables, 0/101 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 35 (OVERLAPS) 14/173 variables, 7/108 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/173 variables, 0/108 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 37 (OVERLAPS) 4/177 variables, 1/109 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/177 variables, 0/109 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 39 (OVERLAPS) 15/192 variables, 9/118 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/192 variables, 0/118 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 41 (OVERLAPS) 19/211 variables, 8/126 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/211 variables, 0/126 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 43 (OVERLAPS) 17/228 variables, 10/136 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/228 variables, 0/136 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 45 (OVERLAPS) 10/238 variables, 6/142 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/238 variables, 0/142 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 47 (OVERLAPS) 5/243 variables, 3/145 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/243 variables, 0/145 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 49 (OVERLAPS) 4/247 variables, 2/147 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/247 variables, 0/147 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 51 (OVERLAPS) 2/249 variables, 1/148 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/249 variables, 0/148 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 53 (OVERLAPS) 0/249 variables, 0/148 constraints. Problems are: Problem set: 104 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 148 constraints, problems are : Problem set: 104 solved, 21 unsolved in 4271 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 21/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 6783ms problems are : Problem set: 104 solved, 21 unsolved
Search for dead transitions found 104 dead transitions in 6790ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/218 places, 22/138 transitions.
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 22 transition count 20
Applied a total of 103 rules in 2 ms. Remains 22 /123 variables (removed 101) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-27 02:30:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 02:30:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 02:30:29] [INFO ] Invariant cache hit.
[2024-05-27 02:30:30] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/218 places, 20/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7171 ms. Remains : 22/218 places, 20/138 transitions.
[2024-05-27 02:30:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:30:30] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:30:30] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-27 02:30:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:30:30] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:30:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14596597649490255896.gal : 2 ms
[2024-05-27 02:30:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6638261849543907004.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14596597649490255896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6638261849543907004.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8674,0.020625,3736,2,230,5,1793,6,0,110,1944,0
Converting to forward existential form...Done !
original formula: A(AX(FALSE) U ((merge_s00001292_input_s00000950>=1)&&(merge_s00001292_input_s00000986>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((merge_s00001292_input_s00000950>=1)&&(merge_s00001292_input_s00000986>=1)))))) * !(E(!(((merg...344
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t7, t10, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.235377,9808,1,0,276,39513,62,127,607,46975,286
FORMULA IBM5964-PT-none-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-27 02:30:30] [INFO ] Flatten gal took : 14 ms
[2024-05-27 02:30:30] [INFO ] Flatten gal took : 13 ms
Total runtime 19769 ms.
BK_STOP 1716777030558
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBM5964-PT-none"
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-5568"
echo " Executing tool itstools"
echo " Input is IBM5964-PT-none, 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 r202-smll-171649588000338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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 ;