About the Execution of ITS-Tools for SmallOperatingSystem-PT-MT0032DC0016
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
257.132 | 12704.00 | 18778.00 | 586.40 | TTTFTTFTFTFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r453-smll-167912644900018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SmallOperatingSystem-PT-MT0032DC0016, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912644900018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 12:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 12:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 5 18:23 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 SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679172250767
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT0032DC0016
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-18 20:44:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:44:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:44:13] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-18 20:44:13] [INFO ] Transformed 9 places.
[2023-03-18 20:44:13] [INFO ] Transformed 8 transitions.
[2023-03-18 20:44:13] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 13 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 20:44:14] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 20:44:14] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-18 20:44:14] [INFO ] Invariant cache hit.
[2023-03-18 20:44:14] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-18 20:44:14] [INFO ] Invariant cache hit.
[2023-03-18 20:44:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-18 20:44:14] [INFO ] Flatten gal took : 19 ms
[2023-03-18 20:44:14] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:44:14] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=115 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:44:14] [INFO ] Invariant cache hit.
[2023-03-18 20:44:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 20:44:14] [INFO ] After 47ms 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 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-18 20:44:14] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:44:14] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:44:14] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:44:14] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:44:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 20:44:14] [INFO ] Invariant cache hit.
[2023-03-18 20:44:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 20:44:15] [INFO ] Invariant cache hit.
[2023-03-18 20:44:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:15] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11975600676283648622.gal : 1 ms
[2023-03-18 20:44:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17684150615844871553.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11975600676283648622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17684150615844871553.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,55029,0.070848,4368,2,168,5,7158,6,0,38,6076,0
Converting to forward existential form...Done !
original formula: AG(EF(EG(AX(((TaskSuspended>=1)&&(CPUUnit>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(!(EX(!(((TaskSuspended>=1)&&(CPUUnit>=1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.123635,4884,1,0,10,8597,22,1,364,8782,9
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 20:44:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:44:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:44:15] [INFO ] Invariant cache hit.
[2023-03-18 20:44:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-18 20:44:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:44:15] [INFO ] Invariant cache hit.
[2023-03-18 20:44:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 102 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:15] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7764707129924581407.gal : 1 ms
[2023-03-18 20:44:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14080378735475218603.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7764707129924581407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14080378735475218603.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,354501,0.067689,4980,2,474,5,9675,6,0,47,9592,0
Converting to forward existential form...Done !
original formula: AG(E(!(EF((ExecutingTask>=1))) U EG(((EG(((TaskSuspended>=1)&&(CPUUnit>=1))) + (LoadingMem<1)) + (E((TaskReady>=1) U (LoadingMem>=1)) + A...248
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(E(TRUE U (ExecutingTask>=1))) U EG(((EG(((TaskSuspended>=1)&&(CPUUnit>=1))) + (Loading...373
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/4
Hit Full ! (commute/partial/dont) 5/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.279899,8940,1,0,15,30937,48,4,484,31752,22
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:44:15] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:44:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 20:44:15] [INFO ] Invariant cache hit.
[2023-03-18 20:44:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-18 20:44:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:44:15] [INFO ] Invariant cache hit.
[2023-03-18 20:44:15] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 110 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:44:15] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15874866318357560518.gal : 1 ms
[2023-03-18 20:44:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16278258153589971410.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15874866318357560518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16278258153589971410.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,55029,0.055224,4440,2,168,5,7158,6,0,38,6076,0
Converting to forward existential form...Done !
original formula: AG(EF(((TaskReady<1)||(CPUUnit<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((TaskReady<1)||(CPUUnit<1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.088325,4704,1,0,6,7158,14,0,346,6076,5
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 5 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 5 cols
[2023-03-18 20:44:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 20:44:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 20:44:15] [INFO ] Invariant cache hit.
[2023-03-18 20:44:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 20:44:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-18 20:44:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:44:15] [INFO ] Invariant cache hit.
[2023-03-18 20:44:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 5/9 places, 6/8 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:44:15] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8546537453458231032.gal : 0 ms
[2023-03-18 20:44:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5755856879228414549.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8546537453458231032.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5755856879228414549.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 20:44:15] [INFO ] Computed 4 place invariants in 1 ms
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5755856879228414549.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.013754,3356,2,14,5,49,6,0,28,26,0
Total reachable state count : 5
[2023-03-18 20:44:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 20:44:16] [INFO ] Invariant cache hit.
[2023-03-18 20:44:16] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-18 20:44:16] [INFO ] Invariant cache hit.
[2023-03-18 20:44:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:16] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15433581069551587801.gal : 1 ms
[2023-03-18 20:44:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17819771907297073964.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15433581069551587801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17819771907297073964.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,354501,0.112849,4984,2,474,5,9675,6,0,47,9592,0
Converting to forward existential form...Done !
original formula: (AX(EG((TransferToDisk<1))) * EG(((EG(!(A((TaskReady>=1) U (((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&(TaskSuspended>=1))))) + (TaskRea...178
=> equivalent forward existential formula: ([(EY(Init) * !(EG((TransferToDisk<1))))] = FALSE * [(Init * !(EG(((EG(!(!((E(!((((TaskOnDisk>=1)&&(DiskControll...404
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2/0/6
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.32565,7624,1,0,16,21278,40,7,466,21007,16
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 2 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 5 cols
[2023-03-18 20:44:16] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 20:44:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:44:16] [INFO ] Invariant cache hit.
[2023-03-18 20:44:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 20:44:16] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 20:44:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:44:16] [INFO ] Invariant cache hit.
[2023-03-18 20:44:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 5/9 places, 6/8 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:16] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:44:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4926943649139409038.gal : 0 ms
[2023-03-18 20:44:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5001155224166898089.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4926943649139409038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5001155224166898089.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5729,0.078533,5216,2,918,5,11630,6,0,28,12075,0
Converting to forward existential form...Done !
original formula: EG(EF((TaskReady>=1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (TaskReady>=1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.303793,6536,1,0,6,15476,18,1,245,16339,10
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 20:44:16] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 20:44:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:44:16] [INFO ] Invariant cache hit.
[2023-03-18 20:44:16] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-18 20:44:16] [INFO ] Invariant cache hit.
[2023-03-18 20:44:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:44:16] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:16] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14419986404908634180.gal : 1 ms
[2023-03-18 20:44:16] [INFO ] Time to serialize properties into /tmp/CTLFireability6683615724615443629.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14419986404908634180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6683615724615443629.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,354501,0.113695,4980,2,474,5,9675,6,0,47,9592,0
Converting to forward existential form...Done !
original formula: ((EX(AX(EF(((((TaskSuspended>=1)&&(CPUUnit>=1))&&((TaskOnDisk>=1)&&(FreeMemSegment>=1)))&&(DiskControllerUnit>=1))))) * EX(AG((((TaskOnDi...560
=> equivalent forward existential formula: [(((FwdU((Init * (EX(!(EX(!(E(TRUE U ((((TaskSuspended>=1)&&(CPUUnit>=1))&&((TaskOnDisk>=1)&&(FreeMemSegment>=1)...648
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 3/0/5
(forward)formula 0,0,0.422965,8412,1,0,24,25478,48,9,473,27840,22
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:44:17] [INFO ] Invariant cache hit.
[2023-03-18 20:44:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 20:44:17] [INFO ] Invariant cache hit.
[2023-03-18 20:44:17] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-18 20:44:17] [INFO ] Invariant cache hit.
[2023-03-18 20:44:17] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-18 20:44:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:17] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:44:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15570285330711976209.gal : 1 ms
[2023-03-18 20:44:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11038582347897614049.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15570285330711976209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11038582347897614049.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,354501,0.108877,4984,2,474,5,9675,6,0,47,9592,0
Converting to forward existential form...Done !
original formula: (!(E(EX(EG((((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&(TaskSuspended>=1)))) U !(A((LoadingMem<1) U (TaskReady<1))))) + (E(!(A(AF((TaskR...444
=> equivalent forward existential formula: ([((Init * !(!(E(EX(EG((((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&(TaskSuspended>=1)))) U !(!((E(!((TaskReady<...995
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/4
Hit Full ! (commute/partial/dont) 4/2/4
Hit Full ! (commute/partial/dont) 2/0/6
(forward)formula 0,1,0.52307,11056,1,0,31,38279,69,16,518,39842,40
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:44:18] [INFO ] Invariant cache hit.
[2023-03-18 20:44:18] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 20:44:18] [INFO ] Invariant cache hit.
[2023-03-18 20:44:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 20:44:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:44:18] [INFO ] Invariant cache hit.
[2023-03-18 20:44:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 110 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-18 20:44:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:18] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:44:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:18] [INFO ] Time to serialize gal into /tmp/CTLFireability13450986408289008975.gal : 1 ms
[2023-03-18 20:44:18] [INFO ] Time to serialize properties into /tmp/CTLFireability13116794945530443749.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13450986408289008975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13116794945530443749.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,354501,0.113006,4980,2,474,5,9675,6,0,47,9592,0
Converting to forward existential form...Done !
original formula: EF((EG((((((TaskOnDisk<1)||(DiskControllerUnit<1))||(TaskSuspended<1))&&(LoadingMem<1))||(TaskReady>=1))) + (EF(((TaskReady>=1)&&(CPUUnit...229
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((((TaskOnDisk<1)||(DiskControllerUnit<1))||(TaskSuspended<1))&&(LoadingMem<1))||(TaskRe...317
Hit Full ! (commute/partial/dont) 0/0/8
(forward)formula 0,1,0.210828,5508,1,0,6,11170,19,0,443,10544,8
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-18 20:44:18] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:44:18] [INFO ] Implicit Places using invariants in 38 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 7/9 places, 8/8 transitions.
[2023-03-18 20:44:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:18] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:44:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7664720456101528906.gal : 1 ms
[2023-03-18 20:44:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10565586835886385845.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7664720456101528906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10565586835886385845.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,354501,0.288355,7864,2,1360,5,30623,6,0,39,30936,0
Converting to forward existential form...Done !
original formula: !(A(AX((ExecutingTask>=1)) U EG(EX(EX((LoadingMem>=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(EX(EX((LoadingMem>=1)))))) * !(!(EX(!((ExecutingTask>=1)))))) * !(EG(EX(EX((LoadingMem>=1))))...223
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.80028,12616,1,0,12,50202,27,3,339,53618,13
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-18 20:44:19] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 20:44:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 20:44:19] [INFO ] Invariant cache hit.
[2023-03-18 20:44:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 20:44:19] [INFO ] Invariant cache hit.
[2023-03-18 20:44:19] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-18 20:44:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:19] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:44:19] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-18 20:44:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:19] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:44:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17479721470094903479.gal : 1 ms
[2023-03-18 20:44:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3371072494783578618.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17479721470094903479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3371072494783578618.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,55029,0.065822,4712,2,185,5,8808,6,0,42,7348,0
Converting to forward existential form...Done !
original formula: EX((A((((TaskSuspended>=1)&&(CPUUnit>=1)) + A(((ExecutingTask>=1)||(((TaskOnDisk>=1)&&(FreeMemSegment>=1))&&(DiskControllerUnit>=1))) U (...324
=> equivalent forward existential formula: (([((EY(Init) * !((E(!((ExecutingTask>=1)) U (!((((TaskSuspended>=1)&&(CPUUnit>=1)) + !((E(!(((TaskReady>=1)||(E...1315
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2/4/5
Hit Full ! (commute/partial/dont) 4/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,0,0.4269,9464,1,0,19,30337,37,8,447,28355,18
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
[2023-03-18 20:44:19] [INFO ] Invariant cache hit.
[2023-03-18 20:44:19] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:44:19] [INFO ] Invariant cache hit.
[2023-03-18 20:44:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-18 20:44:19] [INFO ] Invariant cache hit.
[2023-03-18 20:44:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-18 20:44:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:19] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-18 20:44:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:19] [INFO ] Time to serialize gal into /tmp/CTLFireability85168033083521300.gal : 1 ms
[2023-03-18 20:44:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13662756241504883078.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability85168033083521300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13662756241504883078.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,55029,0.105769,4712,2,185,5,8808,6,0,42,7348,0
Converting to forward existential form...Done !
original formula: AX((EF((EG(((TaskSuspended>=1)&&(CPUUnit>=1))) + ((AG((((TaskOnDisk<1)||(FreeMemSegment<1))||(DiskControllerUnit<1))) * (TaskSuspended>=1...357
=> equivalent forward existential formula: ([(EY((EY(Init) * !(E(TRUE U (EG(((TaskSuspended>=1)&&(CPUUnit>=1))) + ((!(E(TRUE U !((((TaskOnDisk<1)||(FreeMem...637
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.196317,5240,1,0,14,8808,29,2,415,8279,16
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 20:44:20] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:44:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:44:20] [INFO ] Invariant cache hit.
[2023-03-18 20:44:20] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-18 20:44:20] [INFO ] Invariant cache hit.
[2023-03-18 20:44:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-18 20:44:20] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:20] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:20] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 20:44:20] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:44:20] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4880051448280114621.gal : 0 ms
[2023-03-18 20:44:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8757352666055745943.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4880051448280114621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8757352666055745943.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,354501,0.104413,4984,2,474,5,9675,6,0,47,9592,0
Converting to forward existential form...Done !
original formula: AF(((ExecutingTask>=1) * ((AX(AF((LoadingMem>=1))) + A(EX((LoadingMem>=1)) U (((TaskOnDisk>=1)&&(FreeMemSegment>=1))&&((DiskControllerUni...224
=> equivalent forward existential formula: [FwdG(Init,!(((ExecutingTask>=1) * ((!(EX(!(!(EG(!((LoadingMem>=1))))))) + !((E(!((((TaskOnDisk>=1)&&(FreeMemSeg...484
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/8
(forward)formula 0,0,2.11736,45008,1,0,278,233857,34,268,452,225984,278
FORMULA SmallOperatingSystem-PT-MT0032DC0016-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2023-03-18 20:44:22] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:44:22] [INFO ] Flatten gal took : 1 ms
Total runtime 8668 ms.
BK_STOP 1679172263471
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmallOperatingSystem-PT-MT0032DC0016"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is SmallOperatingSystem-PT-MT0032DC0016, 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 r453-smll-167912644900018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0032DC0016.tgz
mv SmallOperatingSystem-PT-MT0032DC0016 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 ;