Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291300010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CircadianClock-PT-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291300010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 22 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Mar 22 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K May 5 16:51 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 CircadianClock-PT-000010-CTLFireability-00
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-01
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-02
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-03
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-04
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-05
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-06
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-07
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-08
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-09
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-10
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-11
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-12
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-13
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-14
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620799266659

Running Version 0
[2021-05-12 06:01:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 06:01:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 06:01:11] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-12 06:01:11] [INFO ] Transformed 14 places.
[2021-05-12 06:01:11] [INFO ] Transformed 16 transitions.
[2021-05-12 06:01:11] [INFO ] Parsed PT model containing 14 places and 16 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 44 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:11] [INFO ] Computed 7 place invariants in 28 ms
[2021-05-12 06:01:11] [INFO ] Implicit Places using invariants in 179 ms returned []
[2021-05-12 06:01:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:01:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-12 06:01:11] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2021-05-12 06:01:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:01:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
[2021-05-12 06:01:11] [INFO ] Flatten gal took : 21 ms
[2021-05-12 06:01:11] [INFO ] Flatten gal took : 8 ms
[2021-05-12 06:01:12] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100005 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=746 ) properties (out of 82) seen :65
Running SMT prover for 17 properties.
[2021-05-12 06:01:12] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:12] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 19 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:12] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-12 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned unsat
Successfully simplified 17 atomic propositions for a total of 16 simplifications.
[2021-05-12 06:01:12] [INFO ] Initial state test concluded for 2 properties.
FORMULA CircadianClock-PT-000010-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000010-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Applied a total of 0 rules in 13 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5772762453431273022.gal : 2 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3293577041210010026.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5772762453431273022.gal, -t, CGAL, -ctl, /tmp/CTLFireability3293577041210010026.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5772762453431273022.gal -t CGAL -ctl /tmp/CTLFireability3293577041210010026.ctl --gen-order FOLLOW
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,644204,0.06869,4912,2,67,5,3794,6,0,75,3865,0


Converting to forward existential form...Done !
original formula: E(((((((((ma>=1)||(mr>=1))||((a>=1)&&(dr>=1)))||((da_a>=1)&&(ma_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((a>=1)&&(da>=1)))||((c>=1)&&(r_cap>=1))) U !(EF(EG(AF(((((a>=1)&&(r>=1))&&(c_cap>=1))||((dr_a>=1)&&(a_cap>=1))))))))
=> equivalent forward existential formula: [(FwdU(Init,((((((((ma>=1)||(mr>=1))||((a>=1)&&(dr>=1)))||((da_a>=1)&&(ma_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((a>=1)&&(da>=1)))||((c>=1)&&(r_cap>=1)))) * !(E(TRUE U EG(!(EG(!(((((a>=1)&&(r>=1))&&(c_cap>=1))||((dr_a>=1)&&(a_cap>=1))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.076392,5232,1,0,8,3794,28,1,470,3865,9
FORMULA CircadianClock-PT-000010-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15313300972384067683.gal : 0 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4365051729484719457.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15313300972384067683.gal, -t, CGAL, -ctl, /tmp/CTLFireability4365051729484719457.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15313300972384067683.gal -t CGAL -ctl /tmp/CTLFireability4365051729484719457.ctl --gen-order FOLLOW
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,644204,0.016025,5004,2,67,5,3794,6,0,75,3865,0


Converting to forward existential form...Done !
original formula: AG(A(EG(!(EG(((((((a>=1)||((a>=1)&&(dr>=1)))||((dr_a>=1)&&(mr_cap>=1)))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||(r>=1))))) U EG(((((((a>=1)&&(dr>=1))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(EG(((((((a>=1)&&(dr>=1))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1)))))) * !(EG(!(EG(((((((a>=1)||((a>=1)&&(dr>=1)))||((dr_a>=1)&&(mr_cap>=1)))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||(r>=1))))))) * !(EG(((((((a>=1)&&(dr>=1))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1))))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(EG(((((((a>=1)&&(dr>=1))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1))))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.023081,5388,1,0,8,3794,22,3,443,3865,10
FORMULA CircadianClock-PT-000010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability18343074854516822549.gal : 7 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8355466099006068539.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability18343074854516822549.gal, -t, CGAL, -ctl, /tmp/CTLFireability8355466099006068539.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability18343074854516822549.gal -t CGAL -ctl /tmp/CTLFireability8355466099006068539.ctl --gen-order FOLLOW
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,644204,0.014777,4940,2,67,5,3794,6,0,75,3865,0


Converting to forward existential form...Done !
original formula: E((((a<1)||(dr<1))&&((c<1)||(r_cap<1))) U ((((((AF((((((EG(((a>=1)&&(da>=1))) + EF((((((dr_a>=1)&&(mr_cap>=1))||(mr>=1))||((dr_a>=1)&&(a_cap>=1)))||((da>=1)&&(ma_cap>=1))))) + (((mr>=1)||((da_a>=1)&&(a_cap>=1)))&&((((((a>=1)||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr_a>=1)&&(mr_cap>=1)))||(mr>=1))||((mr>=1)&&(r_cap>=1)))||((da_a>=1)&&(a_cap>=1))))) + (((((((((a>=1)&&(r>=1))&&(c_cap>=1))||((dr_a>=1)&&(mr_cap>=1)))||(ma>=1))||(mr>=1))||(r>=1))||((dr_a>=1)&&(a_cap>=1)))&&((((((a>=1)||(ma>=1))||(mr>=1))||((dr_a>=1)&&(a_cap>=1)))||((ma>=1)&&(a_cap>=1)))||((da_a>=1)&&(a_cap>=1))))) * ((mr<1)||(r_cap<1))) * ((da_a<1)||(a_cap<1)))) * A((((a>=1)||((a>=1)&&(da>=1)))||((c>=1)&&(r_cap>=1))) U EF((((((dr_a>=1)&&(mr_cap>=1))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1)))))) * (mr<1)) * ((dr<1)||(mr_cap<1))) * ((a<1)||(da<1))) * ((da<1)||(ma_cap<1))) * ((da_a<1)||(a_cap<1))))
=> equivalent forward existential formula: [((((((((FwdU(Init,(((a<1)||(dr<1))&&((c<1)||(r_cap<1)))) * ((da_a<1)||(a_cap<1))) * ((da<1)||(ma_cap<1))) * ((a<1)||(da<1))) * ((dr<1)||(mr_cap<1))) * (mr<1)) * !(EG(!((((((EG(((a>=1)&&(da>=1))) + E(TRUE U (((((dr_a>=1)&&(mr_cap>=1))||(mr>=1))||((dr_a>=1)&&(a_cap>=1)))||((da>=1)&&(ma_cap>=1))))) + (((mr>=1)||((da_a>=1)&&(a_cap>=1)))&&((((((a>=1)||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr_a>=1)&&(mr_cap>=1)))||(mr>=1))||((mr>=1)&&(r_cap>=1)))||((da_a>=1)&&(a_cap>=1))))) + (((((((((a>=1)&&(r>=1))&&(c_cap>=1))||((dr_a>=1)&&(mr_cap>=1)))||(ma>=1))||(mr>=1))||(r>=1))||((dr_a>=1)&&(a_cap>=1)))&&((((((a>=1)||(ma>=1))||(mr>=1))||((dr_a>=1)&&(a_cap>=1)))||((ma>=1)&&(a_cap>=1)))||((da_a>=1)&&(a_cap>=1))))) * ((mr<1)||(r_cap<1))) * ((da_a<1)||(a_cap<1))))))) * !(EG(!(E(TRUE U (((((dr_a>=1)&&(mr_cap>=1))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1)))))))) * !(E(!(E(TRUE U (((((dr_a>=1)&&(mr_cap>=1))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1))))) U (!((((a>=1)||((a>=1)&&(da>=1)))||((c>=1)&&(r_cap>=1)))) * !(E(TRUE U (((((dr_a>=1)&&(mr_cap>=1))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 5/3/11
(forward)formula 0,0,0.034292,5588,1,0,24,3853,49,12,533,4382,24
FORMULA CircadianClock-PT-000010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2288026553276643020.gal : 1 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability16378001423086373873.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2288026553276643020.gal, -t, CGAL, -ctl, /tmp/CTLFireability16378001423086373873.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2288026553276643020.gal -t CGAL -ctl /tmp/CTLFireability16378001423086373873.ctl --gen-order FOLLOW
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,644204,0.013481,4996,2,67,5,3794,6,0,75,3865,0


Converting to forward existential form...Done !
original formula: (!(AF(AG((ma>=1)))) * AG(EF((((((((a>=1)||((da_a>=1)&&(ma_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||(mr>=1))||((dr_a>=1)&&(a_cap>=1)))||((da>=1)&&(ma_cap>=1)))&&((c<1)||(r_cap<1))))))
=> equivalent forward existential formula: ([(Init * !(EG(!(!(E(TRUE U !((ma>=1))))))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U (((((((a>=1)||((da_a>=1)&&(ma_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||(mr>=1))||((dr_a>=1)&&(a_cap>=1)))||((da>=1)&&(ma_cap>=1)))&&((c<1)||(r_cap<1))))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.020533,5316,1,0,7,3794,19,0,457,3865,11
FORMULA CircadianClock-PT-000010-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 0 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17258705231419169481.gal : 1 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5879786828115101116.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17258705231419169481.gal, -t, CGAL, -ctl, /tmp/CTLFireability5879786828115101116.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17258705231419169481.gal -t CGAL -ctl /tmp/CTLFireability5879786828115101116.ctl --gen-order FOLLOW
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,644204,0.015171,5000,2,67,5,3794,6,0,75,3865,0


Converting to forward existential form...Done !
original formula: EG(AG(E(EG(((((((((a>=1)&&(dr>=1))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr_a>=1)&&(mr_cap>=1)))||((dr_a>=1)&&(a_cap>=1)))||((ma>=1)&&(a_cap>=1)))||((da>=1)&&(ma_cap>=1)))||((da_a>=1)&&(a_cap>=1)))) U ((((((((a<1)&&(ma<1))&&(r<1))&&((c<1)||(r_cap<1)))&&((dr_a<1)||(a_cap<1)))||((((((((a<1)&&(ma<1))&&(mr<1))&&((da_a<1)||(ma_cap<1)))&&((dr_a<1)||(mr_cap<1)))&&((c<1)||(r_cap<1)))&&((dr_a<1)||(a_cap<1)))&&((da<1)||(ma_cap<1))))||(((mr<1)&&((a<1)||(dr<1)))&&((a<1)||(da<1))))||(((((((ma<1)&&(r<1))&&((a<1)||(dr<1)))&&((a<1)||(da<1)))&&((mr<1)||(r_cap<1)))&&((dr_a<1)||(a_cap<1)))&&((da<1)||(ma_cap<1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(EG(((((((((a>=1)&&(dr>=1))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr_a>=1)&&(mr_cap>=1)))||((dr_a>=1)&&(a_cap>=1)))||((ma>=1)&&(a_cap>=1)))||((da>=1)&&(ma_cap>=1)))||((da_a>=1)&&(a_cap>=1)))) U ((((((((a<1)&&(ma<1))&&(r<1))&&((c<1)||(r_cap<1)))&&((dr_a<1)||(a_cap<1)))||((((((((a<1)&&(ma<1))&&(mr<1))&&((da_a<1)||(ma_cap<1)))&&((dr_a<1)||(mr_cap<1)))&&((c<1)||(r_cap<1)))&&((dr_a<1)||(a_cap<1)))&&((da<1)||(ma_cap<1))))||(((mr<1)&&((a<1)||(dr<1)))&&((a<1)||(da<1))))||(((((((ma<1)&&(r<1))&&((a<1)||(dr<1)))&&((a<1)||(da<1)))&&((mr<1)||(r_cap<1)))&&((dr_a<1)||(a_cap<1)))&&((da<1)||(ma_cap<1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.063695,6704,1,0,21,9714,30,25,498,14557,36
FORMULA CircadianClock-PT-000010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15232034599293386969.gal : 0 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5076918651051946113.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15232034599293386969.gal, -t, CGAL, -ctl, /tmp/CTLFireability5076918651051946113.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15232034599293386969.gal -t CGAL -ctl /tmp/CTLFireability5076918651051946113.ctl --gen-order FOLLOW
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,644204,0.01446,4888,2,67,5,3794,6,0,75,3865,0


Converting to forward existential form...Done !
original formula: !(EF(!(AF(((((((((a>=1)||((da_a>=1)&&(ma_cap>=1)))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||((a>=1)&&(da>=1)))||(mr>=1))||(r>=1))||((ma>=1)&&(a_cap>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((((((((a>=1)||((da_a>=1)&&(ma_cap>=1)))||(((a>=1)&&(r>=1))&&(c_cap>=1)))||((dr>=1)&&(mr_cap>=1)))||((a>=1)&&(da>=1)))||(mr>=1))||(r>=1))||((ma>=1)&&(a_cap>=1)))))] = FALSE
Hit Full ! (commute/partial/dont) 0/37/16
(forward)formula 0,1,0.018927,5272,1,0,6,3794,20,0,501,3865,8
FORMULA CircadianClock-PT-000010-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-12 06:01:13] [INFO ] Flatten gal took : 3 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 3 ms
[2021-05-12 06:01:13] [INFO ] Applying decomposition
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15929666487432920682.txt, -o, /tmp/graph15929666487432920682.bin, -w, /tmp/graph15929666487432920682.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15929666487432920682.bin, -l, -1, -v, -w, /tmp/graph15929666487432920682.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:01:13] [INFO ] Decomposing Gal with order
[2021-05-12 06:01:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:01:13] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 51 ms
[2021-05-12 06:01:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2021-05-12 06:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15236217680854277112.gal : 1 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9384444931039129998.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15236217680854277112.gal, -t, CGAL, -ctl, /tmp/CTLFireability9384444931039129998.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15236217680854277112.gal -t CGAL -ctl /tmp/CTLFireability9384444931039129998.ctl
No direction supplied, using forward translation only.
Parsed 8 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,644204,0.015524,5092,10,14,1444,269,46,3616,13,1385,0


Converting to forward existential form...Done !
original formula: EG((!(AG((((((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))||(i1.u4.mr>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))) + (!(A(((((((((u0.a>=1)&&(i1.u3.dr>=1))||((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))||(i3.u6.ma>=1))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))&&(i3.u6.ma>=1)) U AX((((u0.a>=1)&&(i3.u2.da>=1))||(i1.u4.mr>=1))))) * !(EF(((((u0.a>=1)&&(i3.u2.da>=1))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))&&((((((((((u0.a>=1)||((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1)))||((u0.a>=1)&&(i1.u3.dr>=1)))||(i1.u4.mr>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||(i2.u5.r>=1))||((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))))))
=> equivalent forward existential formula: [FwdG(Init,(!(!(E(TRUE U !((((((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))||(i1.u4.mr>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))))) + (!(!((E(!(!(EX(!((((u0.a>=1)&&(i3.u2.da>=1))||(i1.u4.mr>=1)))))) U (!(((((((((u0.a>=1)&&(i1.u3.dr>=1))||((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))||(i3.u6.ma>=1))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))&&(i3.u6.ma>=1))) * !(!(EX(!((((u0.a>=1)&&(i3.u2.da>=1))||(i1.u4.mr>=1)))))))) + EG(!(!(EX(!((((u0.a>=1)&&(i3.u2.da>=1))||(i1.u4.mr>=1)))))))))) * !(E(TRUE U ((((u0.a>=1)&&(i3.u2.da>=1))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))&&((((((((((u0.a>=1)||((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1)))||((u0.a>=1)&&(i1.u3.dr>=1)))||(i1.u4.mr>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||(i2.u5.r>=1))||((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,0.051202,5676,1,0,2016,393,302,4593,77,1751,3087
FORMULA CircadianClock-PT-000010-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EF(((((((!(AX(EG((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||((u0.a>=1)&&(i1.u3.dr>=1)))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))) * (i3.u6.ma<1)) * (i1.u4.mr<1)) * (i2.u5.r<1)) * ((u0.a<1)||(i1.u3.dr<1))) * ((i1.u3.dr<1)||(i1.u4.mr_cap<1))) * ((i2.u1.c<1)||(i2.u5.r_cap<1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((((!(!(EX(!(EG((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||((u0.a>=1)&&(i1.u3.dr>=1)))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))))) * (i3.u6.ma<1)) * (i1.u4.mr<1)) * (i2.u5.r<1)) * ((u0.a<1)||(i1.u3.dr<1))) * ((i1.u3.dr<1)||(i1.u4.mr_cap<1))) * ((i2.u1.c<1)||(i2.u5.r_cap<1))))))] = FALSE
(forward)formula 1,1,0.055812,5940,1,0,2122,394,334,4756,79,1761,3287
FORMULA CircadianClock-PT-000010-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((!(EG(((i3.u6.ma<1)&&((u0.a<1)||(i3.u2.da<1))))) + !(EG(EX((((u0.a>=1)||((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1)))||((u0.a>=1)&&(i3.u2.da>=1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(((i3.u6.ma<1)&&((u0.a<1)||(i3.u2.da<1))))) + !(EG(EX((((u0.a>=1)||((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1)))||((u0.a>=1)&&(i3.u2.da>=1)))))))))] = FALSE
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 2,1,0.057688,5940,1,0,2195,396,374,4871,81,1782,3448
FORMULA CircadianClock-PT-000010-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EG((!(EX(TRUE)) + (!(EX((((((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||((u0.a>=1)&&(i1.u3.dr>=1)))||(i1.u4.mr>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||(i2.u5.r>=1))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))) * (((((u0.a>=1)&&(i3.u2.da>=1))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))||((((((((((u0.a<1)&&(i1.u4.mr<1))&&((i3.u6.ma<1)||(u0.a_cap<1)))&&((i2.u1.c<1)||(i2.u5.r_cap<1)))&&((i1.u3.dr_a<1)||(u0.a_cap<1)))&&((i3.u2.da_a<1)||(u0.a_cap<1)))&&((i2.u1.c<1)||(i2.u5.r_cap<1)))&&((i3.u6.ma<1)||(u0.a_cap<1)))&&((i3.u2.da<1)||(i3.u6.ma_cap<1)))&&((i3.u2.da_a<1)||(u0.a_cap<1))))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EX(TRUE)) + (!(EX((((((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||((u0.a>=1)&&(i1.u3.dr>=1)))||(i1.u4.mr>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||(i2.u5.r>=1))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))) * (((((u0.a>=1)&&(i3.u2.da>=1))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))||((((((((((u0.a<1)&&(i1.u4.mr<1))&&((i3.u6.ma<1)||(u0.a_cap<1)))&&((i2.u1.c<1)||(i2.u5.r_cap<1)))&&((i1.u3.dr_a<1)||(u0.a_cap<1)))&&((i3.u2.da_a<1)||(u0.a_cap<1)))&&((i2.u1.c<1)||(i2.u5.r_cap<1)))&&((i3.u6.ma<1)||(u0.a_cap<1)))&&((i3.u2.da<1)||(i3.u6.ma_cap<1)))&&((i3.u2.da_a<1)||(u0.a_cap<1)))))))] != FALSE
(forward)formula 3,0,0.061456,6204,1,0,2246,396,419,4947,81,1786,3572
FORMULA CircadianClock-PT-000010-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(!(EX(TRUE))) * EG(((EF(((((((((EX((((((((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1))||((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))||(i2.u5.r>=1))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u2.da_a>=1)&&(u0.a_cap>=1)))) + (u0.a>=1)) + ((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))) + ((u0.a>=1)&&(i1.u3.dr>=1))) + ((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1))) + ((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1))) + ((i1.u4.mr>=1)&&(i2.u5.r_cap>=1))) + ((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))) + ((i3.u2.da_a>=1)&&(u0.a_cap>=1)))) + (E(((((((((u0.a>=1)&&(i1.u3.dr>=1))||((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))||(i3.u6.ma>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))) U ((((((u0.a>=1)&&(i1.u3.dr>=1))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||(i3.u6.ma>=1))||(i1.u4.mr>=1))||(i2.u5.r>=1))) * (((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1)))||(i1.u4.mr>=1))||((i3.u6.ma>=1)&&(u0.a_cap>=1))))) + AG(((((i3.u2.da_a<1)||(i3.u6.ma_cap<1))&&((u0.a<1)||(i1.u3.dr<1)))&&((i2.u1.c<1)||(i2.u5.r_cap<1)))))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U !(EX(TRUE)))),((E(TRUE U ((((((((EX((((((((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1))||((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))||(i2.u5.r>=1))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u2.da_a>=1)&&(u0.a_cap>=1)))) + (u0.a>=1)) + ((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))) + ((u0.a>=1)&&(i1.u3.dr>=1))) + ((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1))) + ((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1))) + ((i1.u4.mr>=1)&&(i2.u5.r_cap>=1))) + ((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))) + ((i3.u2.da_a>=1)&&(u0.a_cap>=1)))) + (E(((((((((u0.a>=1)&&(i1.u3.dr>=1))||((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))||(i3.u6.ma>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))) U ((((((u0.a>=1)&&(i1.u3.dr>=1))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||(i3.u6.ma>=1))||(i1.u4.mr>=1))||(i2.u5.r>=1))) * (((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1)))||(i1.u4.mr>=1))||((i3.u6.ma>=1)&&(u0.a_cap>=1))))) + !(E(TRUE U !(((((i3.u2.da_a<1)||(i3.u6.ma_cap<1))&&((u0.a<1)||(i1.u3.dr<1)))&&((i2.u1.c<1)||(i2.u5.r_cap<1))))))))] != FALSE
(forward)formula 4,0,0.070104,6204,1,0,2358,396,470,5148,81,1789,3824
FORMULA CircadianClock-PT-000010-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AG(E((((u0.a>=1)||(i2.u5.r>=1))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1))) U ((((((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||(i2.u5.r>=1))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))) + (AX(((i3.u2.da_a>=1)&&(u0.a_cap>=1))) * (((((((E(!(EG(((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))) U EX(TRUE)) + (u0.a>=1)) + ((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))) + ((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1))) + ((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1))) + ((i1.u4.mr>=1)&&(i2.u5.r_cap>=1))) + ((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))) + ((i3.u2.da_a>=1)&&(u0.a_cap>=1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(E((((u0.a>=1)||(i2.u5.r>=1))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1))) U ((((((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1))||((u0.a>=1)&&(i3.u2.da>=1)))||(i2.u5.r>=1))||((i1.u3.dr_a>=1)&&(u0.a_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))))))] != FALSE + ((((((([(EY(FwdU((FwdU(Init,TRUE) * !(EX(!(((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))),!(EG(((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))))) * TRUE)] != FALSE + [((FwdU(Init,TRUE) * !(EX(!(((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))) * (u0.a>=1))] != FALSE) + [((FwdU(Init,TRUE) * !(EX(!(((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))) * ((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1)))] != FALSE) + [((FwdU(Init,TRUE) * !(EX(!(((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))) * ((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1)))] != FALSE) + [((FwdU(Init,TRUE) * !(EX(!(((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))) * ((i1.u3.dr_a>=1)&&(i1.u4.mr_cap>=1)))] != FALSE) + [((FwdU(Init,TRUE) * !(EX(!(((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))) * ((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))] != FALSE) + [((FwdU(Init,TRUE) * !(EX(!(((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))) * ((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))] != FALSE) + [((FwdU(Init,TRUE) * !(EX(!(((i3.u2.da_a>=1)&&(u0.a_cap>=1)))))) * ((i3.u2.da_a>=1)&&(u0.a_cap>=1)))] != FALSE))
(forward)formula 5,0,0.076599,6204,1,0,2496,396,509,5428,81,1801,4137
FORMULA CircadianClock-PT-000010-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(!(EX(((!(EG((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))) + !(EX((((i3.u6.ma>=1)||((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))))) * !(EX(TRUE))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * (!(EG((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))) + !(EX((((i3.u6.ma>=1)||((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1))))))) * !(EX(TRUE)))] = FALSE
(forward)formula 6,1,0.076645,6204,1,0,2496,396,509,5428,81,1801,4137
FORMULA CircadianClock-PT-000010-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((!(AX(((((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))) + !(EG(A((((u0.a<1)&&(i3.u6.ma<1))&&(i2.u5.r<1)) U (((((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1))||(i2.u5.r>=1))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))&&((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))) + EX((((((u0.a>=1)||((u0.a>=1)&&(i1.u3.dr>=1)))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))||(i2.u5.r>=1)))))))) + !(EF(EG(AG((((u0.a<1)||(i2.u5.r<1))||(i2.u1.c_cap<1)))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !((!(!(EX(!(((((i1.u3.dr>=1)&&(i1.u4.mr_cap>=1))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1))))))) + !(EG(!((E(!((((((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1))||(i2.u5.r>=1))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))&&((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))) + EX((((((u0.a>=1)||((u0.a>=1)&&(i1.u3.dr>=1)))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))||(i2.u5.r>=1))))) U (!((((u0.a<1)&&(i3.u6.ma<1))&&(i2.u5.r<1))) * !((((((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1))||(i2.u5.r>=1))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))&&((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))) + EX((((((u0.a>=1)||((u0.a>=1)&&(i1.u3.dr>=1)))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))||(i2.u5.r>=1))))))) + EG(!((((((((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1))||(i2.u5.r>=1))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))&&((((((i3.u2.da_a>=1)&&(i3.u6.ma_cap>=1))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i3.u6.ma>=1)&&(u0.a_cap>=1)))||((i2.u1.c>=1)&&(i2.u5.r_cap>=1)))||((i3.u2.da>=1)&&(i3.u6.ma_cap>=1)))) + EX((((((u0.a>=1)||((u0.a>=1)&&(i1.u3.dr>=1)))||(((u0.a>=1)&&(i2.u5.r>=1))&&(i2.u1.c_cap>=1)))||((i1.u4.mr>=1)&&(i2.u5.r_cap>=1)))||(i2.u5.r>=1))))))))))))),TRUE),!(E(TRUE U !((((u0.a<1)||(i2.u5.r<1))||(i2.u1.c_cap<1))))))] = FALSE
(forward)formula 7,1,0.102062,6204,1,0,2604,396,539,5666,81,1817,4269
FORMULA CircadianClock-PT-000010-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1620799274419

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CircadianClock-PT-000010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CircadianClock-PT-000010, 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 r045-oct2-162038291300010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000010.tgz
mv CircadianClock-PT-000010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;