Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 14:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 14:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 14:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 8.2K May 18 16:43 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-MT0064DC0032-CTLFireability-2024-00
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-01
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-02
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-03
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-04
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-05
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-06
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-07
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-08
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-09
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2023-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2023-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2023-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716965064740

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-MT0064DC0032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 06:44:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 06:44:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 06:44:26] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-29 06:44:26] [INFO ] Transformed 9 places.
[2024-05-29 06:44:26] [INFO ] Transformed 8 transitions.
[2024-05-29 06:44:26] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Initial state reduction rules removed 2 formulas.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2023-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 14 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-29 06:44:27] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 06:44:27] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 06:44:27] [INFO ] Invariant cache hit.
[2024-05-29 06:44:27] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-29 06:44:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 482ms
Finished structural reductions in LTL mode , in 1 iterations and 866 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2024-05-29 06:44:28] [INFO ] Flatten gal took : 27 ms
[2024-05-29 06:44:28] [INFO ] Flatten gal took : 9 ms
[2024-05-29 06:44:28] [INFO ] Input system was already deterministic with 8 transitions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 32737 steps (7 resets) in 344 ms. (94 steps per ms) remains 0/25 properties
[2024-05-29 06:44:28] [INFO ] Flatten gal took : 5 ms
[2024-05-29 06:44:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 06:44:28] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL 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
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 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 6 transition count 6
Applied a total of 6 rules in 36 ms. Remains 6 /9 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-29 06:44:28] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 06:44:28] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 06:44:28] [INFO ] Invariant cache hit.
[2024-05-29 06:44:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 06:44:28] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 06:44:28] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-29 06:44:28] [INFO ] Invariant cache hit.
[2024-05-29 06:44:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/12 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 265ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 266ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/9 places, 6/8 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 386 ms. Remains : 6/9 places, 6/8 transitions.
[2024-05-29 06:44:29] [INFO ] Flatten gal took : 4 ms
[2024-05-29 06:44:29] [INFO ] Flatten gal took : 3 ms
[2024-05-29 06:44:29] [INFO ] Input system was already deterministic with 6 transitions.
[2024-05-29 06:44:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4620418136376439212.gal : 2 ms
[2024-05-29 06:44:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7050590005996203879.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4620418136376439212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7050590005996203879.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,41921,0.555394,10956,2,3431,5,38518,6,0,32,39426,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((((TaskOnDisk<1)||(FreeMemSegment<1))||(DiskControllerUnit<1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((((TaskOnDisk<1)||(FreeMemSegment<1))||(DiskControllerUnit<1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.886238,14908,1,0,8,51160,23,3,433,57583,10
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-00 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 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-29 06:44:29] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 06:44:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 06:44:30] [INFO ] Invariant cache hit.
[2024-05-29 06:44:30] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-29 06:44:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 269ms
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 9/9 places, 8/8 transitions.
[2024-05-29 06:44:30] [INFO ] Flatten gal took : 3 ms
[2024-05-29 06:44:30] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:30] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-29 06:44:30] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:30] [INFO ] Flatten gal took : 3 ms
[2024-05-29 06:44:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3247538800142394192.gal : 3 ms
[2024-05-29 06:44:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4710360518202475453.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3247538800142394192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4710360518202475453.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.13364e+06,0.493807,9996,2,1450,5,35227,6,0,47,35840,0


Converting to forward existential form...Done !
original formula: E(!(((EG(((TaskReady>=1)&&(CPUUnit>=1))) + (((!(((ExecutingTask>=1) * E((TaskReady>=1) U ((TaskReady>=1)&&(CPUUnit>=1))))) * (TaskOnDisk>...626
=> equivalent forward existential formula: (([((FwdU(Init,!(((EG(((TaskReady>=1)&&(CPUUnit>=1))) + (((!(((ExecutingTask>=1) * E((TaskReady>=1) U ((TaskRead...1790
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/4
(forward)formula 0,0,1.60597,25804,1,0,25,127549,56,11,699,127993,29
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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 7 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-29 06:44:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 06:44:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 06:44:32] [INFO ] Invariant cache hit.
[2024-05-29 06:44:32] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2024-05-29 06:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 6 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 196ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 197ms
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 7/9 places, 7/8 transitions.
[2024-05-29 06:44:32] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:32] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:32] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-29 06:44:32] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:32] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11393276051378286680.gal : 1 ms
[2024-05-29 06:44:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5389827302024106031.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11393276051378286680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5389827302024106031.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,762025,0.297536,8132,2,328,5,25838,6,0,38,22148,0


Converting to forward existential form...Done !
original formula: EF(((EX(EG(((TaskSuspended<1)||(CPUUnit<1)))) * (TaskReady<1)) * (AG(((TaskSuspended<1)||(CPUUnit<1))) * ((TaskSuspended<1)||(CPUUnit<1))...158
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (EX(EG(((TaskSuspended<1)||(CPUUnit<1)))) * (TaskReady<1))) * ((TaskSuspended<1)||(CPUUnit...222
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.447778,8396,1,0,6,25838,15,0,539,22148,5
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL 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
[2024-05-29 06:44:32] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 06:44:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 06:44:32] [INFO ] Invariant cache hit.
[2024-05-29 06:44:32] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-29 06:44:32] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-29 06:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 337ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 437 ms. Remains : 9/9 places, 8/8 transitions.
[2024-05-29 06:44:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:33] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-29 06:44:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:33] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11829184184408270415.gal : 2 ms
[2024-05-29 06:44:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9407284279270325126.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11829184184408270415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9407284279270325126.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.13364e+06,0.565147,9996,2,1450,5,35227,6,0,47,35840,0


Converting to forward existential form...Done !
original formula: A(A((EF(!(E((((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&(TaskSuspended>=1)) U ((TaskReady>=1)&&(CPUUnit>=1))))) * (ExecutingTask>=1)) U ...192
=> equivalent forward existential formula: [((Init * !(EG(!((TaskReady>=1))))) * !(E(!((TaskReady>=1)) U (!(!((E(!(E(TRUE U (LoadingMem<1))) U (!((E(TRUE U...386
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.08953,13428,1,0,10,53699,31,4,666,47800,10
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-03 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.
[2024-05-29 06:44:34] [INFO ] Invariant cache hit.
[2024-05-29 06:44:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 06:44:34] [INFO ] Invariant cache hit.
[2024-05-29 06:44:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-29 06:44:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 195ms
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 9/9 places, 8/8 transitions.
[2024-05-29 06:44:34] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:34] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:34] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-29 06:44:34] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:34] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10256739663601876867.gal : 1 ms
[2024-05-29 06:44:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15656340292945478001.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10256739663601876867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15656340292945478001.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,9.13364e+06,0.529137,9996,2,1450,5,35227,6,0,47,35840,0


Converting to forward existential form...Done !
original formula: AG((((EX(EF((((TaskOnDisk>=1)&&(FreeMemSegment>=1))&&(DiskControllerUnit>=1)))) + AF((TransferToDisk>=1))) + (EG(EX((((TaskOnDisk>=1)&&(D...471
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(((EX(E(TRUE U (((TaskOnDisk>=1)&&(FreeMemSegment>=1))&&(DiskControllerUnit>=1)))) + !(E...942
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,1.19222,15012,1,0,21,65531,38,8,692,67783,17
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-04 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.
[2024-05-29 06:44:35] [INFO ] Invariant cache hit.
[2024-05-29 06:44:35] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 06:44:35] [INFO ] Invariant cache hit.
[2024-05-29 06:44:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-29 06:44:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 9/9 places, 8/8 transitions.
[2024-05-29 06:44:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:36] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-29 06:44:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:36] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2545692536984743223.gal : 2 ms
[2024-05-29 06:44:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3621739384423773084.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2545692536984743223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3621739384423773084.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.13364e+06,0.545515,9992,2,1450,5,35227,6,0,47,35840,0


Converting to forward existential form...Done !
original formula: (EF(((((AG((((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&((TaskSuspended>=1)&&(TaskReady>=1)))) * (((TaskOnDisk<1)||(DiskControllerUnit<1)...724
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((((!(E(TRUE U !((((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&((TaskSuspended>=1)&&(Task...812
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.922856,13952,1,0,14,60677,38,2,683,56529,14
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-05 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 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-29 06:44:37] [INFO ] Invariant cache hit.
[2024-05-29 06:44:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 06:44:37] [INFO ] Invariant cache hit.
[2024-05-29 06:44:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-29 06:44:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 201ms
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 9/9 places, 8/8 transitions.
[2024-05-29 06:44:37] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:37] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:37] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-29 06:44:37] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:37] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17446253115776065073.gal : 4 ms
[2024-05-29 06:44:37] [INFO ] Time to serialize properties into /tmp/CTLFireability5274258991804498976.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17446253115776065073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5274258991804498976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.13364e+06,0.342373,9996,2,1450,5,35227,6,0,47,35840,0


Converting to forward existential form...Done !
original formula: A(!((((EF((TaskReady>=1)) * EX(!(E((TransferToDisk>=1) U (ExecutingTask>=1))))) + E(((TransferToDisk<1) * AF((((TaskOnDisk>=1)&&(FreeMemS...553
=> equivalent forward existential formula: [((Init * !(EG(!(E((!(EG(!(!((((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&((TaskSuspended>=1)&&(TaskReady>=1))))...1353
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/4
Hit Full ! (commute/partial/dont) 6/0/2
Hit Full ! (commute/partial/dont) 6/0/2
(forward)formula 0,0,1.75264,28056,1,0,127,119366,66,77,711,121658,103
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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
Applied a total of 0 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-29 06:44:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 06:44:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 06:44:39] [INFO ] Invariant cache hit.
[2024-05-29 06:44:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-29 06:44:39] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-29 06:44:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/16 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 11 constraints, problems are : Problem set: 0 solved, 7 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/16 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 7 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 261 ms. Remains : 8/9 places, 8/8 transitions.
[2024-05-29 06:44:39] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:39] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:39] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-29 06:44:39] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:39] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14409238900127649763.gal : 0 ms
[2024-05-29 06:44:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1210671337527838345.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14409238900127649763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1210671337527838345.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.13364e+06,1.29939,22080,2,4025,5,136279,6,0,43,133852,0


Converting to forward existential form...Done !
original formula: AF(((TaskReady>=1) * A(((AF(((TaskReady>=1)&&(CPUUnit>=1))) + E(((TaskReady>=1)&&(CPUUnit>=1)) U (TransferToDisk>=1))) * EF(((LoadingMem>...318
=> equivalent forward existential formula: [FwdG(Init,!(((TaskReady>=1) * !((E(!((((LoadingMem>=1) + (E(TRUE U (ExecutingTask>=1)) * ((TaskReady>=1)||(Load...660
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/4
Hit Full ! (commute/partial/dont) 2/5/6
Using saturation style SCC detection
(forward)formula 0,1,4.40174,51912,1,0,118,264844,50,81,662,286775,93
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-07 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.
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 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-29 06:44:43] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 06:44:43] [INFO ] Implicit Places using invariants in 32 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 39 ms. Remains : 7/9 places, 7/8 transitions.
[2024-05-29 06:44:43] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:43] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:43] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-29 06:44:43] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:43] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13490715636039030937.gal : 1 ms
[2024-05-29 06:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6708736195393977390.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13490715636039030937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6708736195393977390.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,762025,0.33579,9188,2,296,5,31950,6,0,38,26931,0


Converting to forward existential form...Done !
original formula: EG((AF(((TaskReady>=1)&&(ExecutingTask<1))) + ((ExecutingTask>=1)&&(((TaskOnDisk<1)||(DiskControllerUnit<1))||(TaskSuspended<1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((TaskReady>=1)&&(ExecutingTask<1))))) + ((ExecutingTask>=1)&&(((TaskOnDisk<1)||(DiskControll...198
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,4.75263,79004,1,0,454,349612,24,448,523,369154,455
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-08 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
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 3 place count 6 transition count 7
Applied a total of 3 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-29 06:44:48] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 06:44:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 06:44:48] [INFO ] Invariant cache hit.
[2024-05-29 06:44:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 06:44:48] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-29 06:44:48] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-29 06:44:48] [INFO ] Invariant cache hit.
[2024-05-29 06:44:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/13 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/13 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/9 places, 7/8 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 271 ms. Remains : 6/9 places, 7/8 transitions.
[2024-05-29 06:44:48] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:48] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:48] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-29 06:44:48] [INFO ] Flatten gal took : 0 ms
[2024-05-29 06:44:48] [INFO ] Flatten gal took : 0 ms
[2024-05-29 06:44:48] [INFO ] Time to serialize gal into /tmp/CTLFireability7672589806021718553.gal : 1 ms
[2024-05-29 06:44:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15994663701428650347.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7672589806021718553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15994663701428650347.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,564553,1.03776,22656,2,4951,5,138012,6,0,33,137268,0


Converting to forward existential form...Done !
original formula: EG(((TaskReady<1)&&(TransferToDisk<1)))
=> equivalent forward existential formula: [FwdG(Init,((TaskReady<1)&&(TransferToDisk<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/4/5
(forward)formula 0,0,2.51792,31632,1,0,7,188126,19,1,443,192265,8
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL 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
[2024-05-29 06:44:51] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 06:44:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 06:44:51] [INFO ] Invariant cache hit.
[2024-05-29 06:44:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 06:44:51] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-29 06:44:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/15 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/15 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 180ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/9 places, 7/8 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 247 ms. Remains : 8/9 places, 7/8 transitions.
[2024-05-29 06:44:51] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:51] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:51] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-29 06:44:51] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:51] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14540358486115794770.gal : 1 ms
[2024-05-29 06:44:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3303091942899211070.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14540358486115794770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3303091942899211070.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,762025,0.333581,9460,2,361,5,32208,6,0,42,26996,0


Converting to forward existential form...Done !
original formula: A(EG(EF((((TaskOnDisk>=1)&&(FreeMemSegment>=1))&&(DiskControllerUnit>=1)))) U E(!((((((TaskReady>=1)&&(CPUUnit>=1))&&((TaskSuspended>=1)&...343
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((((((TaskReady>=1)&&(CPUUnit>=1))&&((TaskSuspended>=1)&&(CPUUnit>=1)))&&(!(((TaskOnDisk>=1)...1113
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Using saturation style SCC detection
(forward)formula 0,0,2.36615,34140,1,0,18,170004,39,8,642,168631,19
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2024-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 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
[2024-05-29 06:44:54] [INFO ] Invariant cache hit.
[2024-05-29 06:44:54] [INFO ] Implicit Places using invariants in 23 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 7/9 places, 7/8 transitions.
[2024-05-29 06:44:54] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:54] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:54] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-29 06:44:54] [INFO ] Flatten gal took : 2 ms
[2024-05-29 06:44:54] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:54] [INFO ] Time to serialize gal into /tmp/CTLFireability365633071908224846.gal : 1 ms
[2024-05-29 06:44:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14554415299721966713.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability365633071908224846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14554415299721966713.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,762025,0.525544,9192,2,296,5,31950,6,0,38,26931,0


Converting to forward existential form...Done !
original formula: AG(AX((((ExecutingTask>=1) * A(AX((((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&(TaskSuspended>=1))) U A((TaskReady>=1) U (TaskReady>=1)))...350
=> equivalent forward existential formula: (([((EY(FwdU(Init,TRUE)) * !(((ExecutingTask>=1) * !((E(!(!((E(!((TaskReady>=1)) U (!((TaskReady>=1)) * !((TaskR...1594
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/3
Using saturation style SCC detection
(forward)formula 0,0,1.48541,22004,1,0,111,100922,32,72,555,122396,81
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2023-12 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 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
[2024-05-29 06:44:55] [INFO ] Invariant cache hit.
[2024-05-29 06:44:55] [INFO ] Implicit Places using invariants in 25 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 7/9 places, 7/8 transitions.
[2024-05-29 06:44:55] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:55] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:55] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-29 06:44:55] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:55] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18197940428601524402.gal : 1 ms
[2024-05-29 06:44:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3175297100845523558.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18197940428601524402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3175297100845523558.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,762025,0.331642,9184,2,296,5,31950,6,0,38,26931,0


Converting to forward existential form...Done !
original formula: EF(((ExecutingTask>=1) + (!(E(EX((((TaskOnDisk>=1)&&(DiskControllerUnit>=1))&&(TaskSuspended>=1))) U AF((TaskReady>=1)))) * AX((Executing...166
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (ExecutingTask>=1))] != FALSE + [((FwdU(Init,TRUE) * !(E(EX((((TaskOnDisk>=1)&&(DiskControl...261
(forward)formula 0,1,0.333561,9448,1,0,7,31950,8,1,103,26931,1
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2023-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
[2024-05-29 06:44:56] [INFO ] Computed 4 invariants in 0 ms
[2024-05-29 06:44:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 06:44:56] [INFO ] Invariant cache hit.
[2024-05-29 06:44:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-29 06:44:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 250ms
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 9/9 places, 8/8 transitions.
[2024-05-29 06:44:56] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:56] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:56] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-29 06:44:56] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:56] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:44:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13571975141290244879.gal : 1 ms
[2024-05-29 06:44:56] [INFO ] Time to serialize properties into /tmp/CTLFireability169973178688314804.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13571975141290244879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability169973178688314804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.13364e+06,0.366924,9996,2,1450,5,35227,6,0,47,35840,0


Converting to forward existential form...Done !
original formula: AX(A((((LoadingMem>=1) * !(EG((ExecutingTask>=1)))) * (TransferToDisk>=1)) U !((((!(((TaskReady>=1)&&(CPUUnit>=1))&&((TaskSuspended>=1)&&...378
=> equivalent forward existential formula: (([((FwdU(EY(Init),!(!((((!(((TaskReady>=1)&&(CPUUnit>=1))&&((TaskSuspended>=1)&&(CPUUnit>=1))))||(!(((Executing...1417
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 3/5/5
(forward)formula 0,0,19.7681,370280,1,0,579,2.42671e+06,24,577,695,2.48967e+06,588
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 06:45:16] [INFO ] Flatten gal took : 1 ms
[2024-05-29 06:45:16] [INFO ] Flatten gal took : 1 ms
Total runtime 49741 ms.

BK_STOP 1716965116310

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmallOperatingSystem-PT-MT0064DC0032"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmallOperatingSystem-PT-MT0064DC0032, 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 r378-smll-171683811000218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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