Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.4K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-00
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-01
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-02
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-03
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-04
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-05
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-06
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-07
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-08
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-09
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-10
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-11
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-12
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-13
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-14
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620946875445

Running Version 0
[2021-05-13 23:01:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 23:01:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:01:18] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-13 23:01:18] [INFO ] Transformed 15 places.
[2021-05-13 23:01:18] [INFO ] Transformed 11 transitions.
[2021-05-13 23:01:18] [INFO ] Parsed PT model containing 15 places and 11 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 12 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:01:18] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-13 23:01:18] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:01:18] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 23:01:18] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:01:18] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 23:01:18] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-13 23:01:18] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 23:01:18] [INFO ] Flatten gal took : 32 ms
FORMULA RobotManipulation-PT-00001-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 23:01:18] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:01:18] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=271 ) properties (out of 60) seen :57
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:01:19] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 23:01:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:01:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 23:01:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:01:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:01:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 23:01:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:01:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:01:19] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Applied a total of 0 rules in 6 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-13 23:01:19] [INFO ] Flatten gal took : 3 ms
[2021-05-13 23:01:19] [INFO ] Flatten gal took : 6 ms
[2021-05-13 23:01:19] [INFO ] Input system was already deterministic with 11 transitions.
[2021-05-13 23:01:19] [INFO ] Flatten gal took : 4 ms
[2021-05-13 23:01:19] [INFO ] Flatten gal took : 3 ms
[2021-05-13 23:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8617934365991813942.gal : 1 ms
[2021-05-13 23:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3727170477207786632.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8617934365991813942.gal, -t, CGAL, -ctl, /tmp/CTLFireability3727170477207786632.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8617934365991813942.gal -t CGAL -ctl /tmp/CTLFireability3727170477207786632.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,110,0.012361,4280,2,88,5,502,6,0,74,414,0


Converting to forward existential form...Done !
original formula: (!(A((E(E(((((initialized>=1)&&(p_i2>=1))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1)) U (((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||((initialized>=1)&&(p_i2>=1)))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))) U EF((((p_rdy>=1)&&(access>=1))||((moved>=1)&&(p_m>=1))))) * EF(((((r_moving>=1)&&((p_rel>=1)||(p_i1>=1)))&&((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(p_rdy>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1))))&&((((((r_moving>=1)||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1))||(p_i1>=1))))) U ((EG((A((((((((r_moving>=1)||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1)))||(p_rel>=1)) U (((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))) + (((move>=1)&&(r_active>=1))&&((((p_rdy>=1)||((off>=1)&&(r_active>=1)))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))))) * AG((((((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||(p_rdy>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1))||(p_i1>=1)))) * AG(((((((((((initialize>=1)&&(r_stopped>=1))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1)))||(p_rel>=1))&&(((((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))||(p_i1>=1))))))) + !(E(!(AG(((((((((((AG(((((((((move>=1)&&(r_active>=1))||(p_rdy>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||(p_rel>=1))||(p_i1>=1))) * ((initialize<1)||(r_stopped<1))) * ((move<1)||(r_active<1))) * (r_moving<1)) * ((initialized<1)||(p_i2<1))) * (p_rdy<1)) * ((off<1)||(r_active<1))) * (p_sc<1)) * ((moved<1)||(p_m<1))) * ((p_rdy<1)||(access<1))) * (p_i1<1)))) U AG(((((move<1)||(r_active<1))&&(r_moving<1))&&((off<1)||(r_active<1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(!((E(!(((EG((!((E(!((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))) U (!((((((((r_moving>=1)||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1)))||(p_rel>=1))) * !((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))))) + EG(!((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1))))))) + (((move>=1)&&(r_active>=1))&&((((p_rdy>=1)||((off>=1)&&(r_active>=1)))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))))) * !(E(TRUE U !((((((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||(p_rdy>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1))||(p_i1>=1)))))) * !(E(TRUE U !(((((((((((initialize>=1)&&(r_stopped>=1))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1)))||(p_rel>=1))&&(((((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))||(p_i1>=1)))))))) U (!((E(E(((((initialized>=1)&&(p_i2>=1))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1)) U (((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||((initialized>=1)&&(p_i2>=1)))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))) U E(TRUE U (((p_rdy>=1)&&(access>=1))||((moved>=1)&&(p_m>=1))))) * E(TRUE U ((((r_moving>=1)&&((p_rel>=1)||(p_i1>=1)))&&((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(p_rdy>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1))))&&((((((r_moving>=1)||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1))||(p_i1>=1)))))) * !(((EG((!((E(!((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))) U (!((((((((r_moving>=1)||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1)))||(p_rel>=1))) * !((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))))) + EG(!((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1))))))) + (((move>=1)&&(r_active>=1))&&((((p_rdy>=1)||((off>=1)&&(r_active>=1)))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))))) * !(E(TRUE U !((((((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||(p_rdy>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1))||(p_i1>=1)))))) * !(E(TRUE U !(((((((((((initialize>=1)&&(r_stopped>=1))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1)))||(p_rel>=1))&&(((((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))||(p_i1>=1)))))))))) + EG(!(((EG((!((E(!((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))) U (!((((((((r_moving>=1)||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1)))||(p_rel>=1))) * !((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))))) + EG(!((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||(p_rdy>=1))||(p_sc>=1))||((moved>=1)&&(p_m>=1))))))) + (((move>=1)&&(r_active>=1))&&((((p_rdy>=1)||((off>=1)&&(r_active>=1)))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))))) * !(E(TRUE U !((((((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||(p_rdy>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1))||(p_i1>=1)))))) * !(E(TRUE U !(((((((((((initialize>=1)&&(r_stopped>=1))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1)))||(p_rel>=1))&&(((((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))||(p_i1>=1)))))))))))))),!(!(E(TRUE U !(((((((((((!(E(TRUE U !(((((((((move>=1)&&(r_active>=1))||(p_rdy>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_sc>=1))||(p_rel>=1))||(p_i1>=1))))) * ((initialize<1)||(r_stopped<1))) * ((move<1)||(r_active<1))) * (r_moving<1)) * ((initialized<1)||(p_i2<1))) * (p_rdy<1)) * ((off<1)||(r_active<1))) * (p_sc<1)) * ((moved<1)||(p_m<1))) * ((p_rdy<1)||(access<1))) * (p_i1<1))))))) * !(E(TRUE U !(((((move<1)||(r_active<1))&&(r_moving<1))&&((off<1)||(r_active<1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.019636,4732,1,0,6,1038,15,0,354,691,5
FORMULA RobotManipulation-PT-00001-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 4 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2021-05-13 23:01:19] [INFO ] Flatten gal took : 2 ms
[2021-05-13 23:01:19] [INFO ] Flatten gal took : 2 ms
[2021-05-13 23:01:19] [INFO ] Input system was already deterministic with 11 transitions.
[2021-05-13 23:01:19] [INFO ] Flatten gal took : 2 ms
[2021-05-13 23:01:19] [INFO ] Flatten gal took : 2 ms
[2021-05-13 23:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16060638135425252616.gal : 0 ms
[2021-05-13 23:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9420595887656280524.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16060638135425252616.gal, -t, CGAL, -ctl, /tmp/CTLFireability9420595887656280524.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16060638135425252616.gal -t CGAL -ctl /tmp/CTLFireability9420595887656280524.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,110,0.005293,4368,2,76,5,467,6,0,70,386,0


Converting to forward existential form...Done !
original formula: AG((!(AF((((r_moving>=1)||((off>=1)&&(r_active>=1)))||(p_rdy>=1)))) + ((((p_sc<1)&&(p_i1<1))&&((p_rdy<1)||(access<1)))&&((moved<1)||(p_m<1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((((p_sc<1)&&(p_i1<1))&&((p_rdy<1)||(access<1)))&&((moved<1)||(p_m<1))))) * !(EG(!((((r_moving>=1)||((off>=1)&&(r_active>=1)))||(p_rdy>=1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.015373,5072,1,0,8,1950,21,2,346,1417,6
FORMULA RobotManipulation-PT-00001-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15530219519137314935.gal -t CGAL -ctl /tmp/CTLFireability3527939235680097398.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,110,0.005145,4284,2,88,5,502,6,0,74,414,0


Converting to forward existential form...Done !
original formula: AG((EG((((((move>=1)&&(r_active>=1))||(p_rdy>=1))||(p_sc>=1))||(p_i1>=1))) * (EF(((((((((((initialize<1)||(r_stopped<1))&&((move<1)||(r_active<1)))&&(r_moving<1))&&(p_rdy<1))&&((initialized<1)||(p_i2<1)))&&((p_rdy<1)||(access<1)))&&((moved<1)||(p_m<1)))&&(p_rel<1))&&(p_i1<1))) + (((EF(((((((initialize>=1)&&(r_stopped>=1))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))) * (initialized>=1)) * (p_i2>=1)) * (((((r_moving>=1)||(p_rdy>=1))||(p_rel>=1))||(p_i1>=1))||((initialize>=1)&&(r_stopped>=1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((((((move>=1)&&(r_active>=1))||(p_rdy>=1))||(p_sc>=1))||(p_i1>=1)))))] = FALSE * [((FwdU(Init,TRUE) * !((((E(TRUE U ((((((initialize>=1)&&(r_stopped>=1))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((moved>=1)&&(p_m>=1)))||((p_rdy>=1)&&(access>=1)))) * (initialized>=1)) * (p_i2>=1)) * (((((r_moving>=1)||(p_rdy>=1))||(p_rel>=1))||(p_i1>=1))||((initialize>=1)&&(r_stopped>=1)))))) * !(E(TRUE U ((((((((((initialize<1)||(r_stopped<1))&&((move<1)||(r_active<1)))&&(r_moving<1))&&(p_rdy<1))&&((initialized<1)||(p_i2<1)))&&((p_rdy<1)||(access<1)))&&((moved<1)||(p_m<1)))&&(p_rel<1))&&(p_i1<1)))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.018129,4988,1,0,8,1693,23,2,396,1446,9
FORMULA RobotManipulation-PT-00001-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8899695189102361904.gal -t CGAL -ctl /tmp/CTLFireability9387516277560693442.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,110,0.00517,4280,2,88,5,502,6,0,74,414,0


Converting to forward existential form...Done !
original formula: EG(((AF(((((((((initialize>=1)&&(r_stopped>=1))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||((p_rdy>=1)&&(access>=1)))||(p_i1>=1))) + AF((((p_rdy>=1)||(p_rel>=1))||(p_i1>=1)))) + ((((((((r_moving>=1)||(p_rdy>=1))||(p_sc>=1))||(p_rel>=1))||(p_i1>=1))||((initialize>=1)&&(r_stopped>=1)))||((off>=1)&&(r_active>=1)))&&(((((((((r_moving>=1)||(p_sc>=1))||(p_rel>=1))||((initialize>=1)&&(r_stopped>=1)))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1))))))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(((((((((initialize>=1)&&(r_stopped>=1))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||((p_rdy>=1)&&(access>=1)))||(p_i1>=1))))) + !(EG(!((((p_rdy>=1)||(p_rel>=1))||(p_i1>=1)))))) + ((((((((r_moving>=1)||(p_rdy>=1))||(p_sc>=1))||(p_rel>=1))||(p_i1>=1))||((initialize>=1)&&(r_stopped>=1)))||((off>=1)&&(r_active>=1)))&&(((((((((r_moving>=1)||(p_sc>=1))||(p_rel>=1))||((initialize>=1)&&(r_stopped>=1)))||((move>=1)&&(r_active>=1)))||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||((p_rdy>=1)&&(access>=1)))||((moved>=1)&&(p_m>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.023201,5248,1,0,8,2347,30,2,412,1762,10
FORMULA RobotManipulation-PT-00001-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5054706057433769752.gal -t CGAL -ctl /tmp/CTLFireability9782139591090069034.ctl
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,110,0.008036,4392,51,56,286,180,62,356,35,371,0


Converting to forward existential form...Done !
original formula: EX((((((u0.p_i1>=1)||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1))))
=> equivalent forward existential formula: [(EY(Init) * (((((u0.p_i1>=1)||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1))))] != FALSE
(forward)formula 0,1,0.011328,4828,1,0,286,180,102,356,53,371,177
FORMULA RobotManipulation-PT-00001-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((((EX(EF(((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u1.r_moving>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1)))) + !(EX(AX((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||(u0.p_rdy>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))))) + EF((!(AF(((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))) + EX(((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))))) + (!(E(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1)) U ((((((i2.u2.move>=1)&&(u1.r_active>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))) * !(AG((u1.r_moving>=1))))))
=> equivalent forward existential formula: [FwdG(Init,(((EX(E(TRUE U ((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u1.r_moving>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1)))) + !(EX(!(EX(!((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||(u0.p_rdy>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))))))) + E(TRUE U (!(!(EG(!(((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))))) + EX(((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))))) + (!(E(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1)) U ((((((i2.u2.move>=1)&&(u1.r_active>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))) * !(!(E(TRUE U !((u1.r_moving>=1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 2
(forward)formula 1,1,0.045466,5620,1,0,1002,625,347,1823,180,1323,2464
FORMULA RobotManipulation-PT-00001-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(EX((((((((((!(AF(EX((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))))) + (u1.r_moving>=1)) + (u0.p_rdy>=1)) + (i2.u3.p_rel>=1)) + (u0.p_i1>=1)) + ((u0.initialize>=1)&&(u1.r_stopped>=1))) + ((i2.u2.move>=1)&&(u1.r_active>=1))) + ((u0.initialized>=1)&&(u0.p_i2>=1))) + ((u1.off>=1)&&(u1.r_active>=1))) + ((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))))
=> equivalent forward existential formula: ((((((((([FwdG(EY(EY(Init)),!(EX((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))))] != FALSE + [(EY(EY(Init)) * (u1.r_moving>=1))] != FALSE) + [(EY(EY(Init)) * (u0.p_rdy>=1))] != FALSE) + [(EY(EY(Init)) * (i2.u3.p_rel>=1))] != FALSE) + [(EY(EY(Init)) * (u0.p_i1>=1))] != FALSE) + [(EY(EY(Init)) * ((u0.initialize>=1)&&(u1.r_stopped>=1)))] != FALSE) + [(EY(EY(Init)) * ((i2.u2.move>=1)&&(u1.r_active>=1)))] != FALSE) + [(EY(EY(Init)) * ((u0.initialized>=1)&&(u0.p_i2>=1)))] != FALSE) + [(EY(EY(Init)) * ((u1.off>=1)&&(u1.r_active>=1)))] != FALSE) + [(EY(EY(Init)) * ((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))] != FALSE)
(forward)formula 2,1,0.050053,5620,1,0,1023,626,357,1851,180,1332,2513
FORMULA RobotManipulation-PT-00001-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((AX(AG(AX((((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1))))) * (A((u1.r_moving>=1) U ((((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))) + (AG(((((((((u0.initialize<1)||(u1.r_stopped<1))&&((i2.u2.move<1)||(u1.r_active<1)))&&(u0.p_rdy<1))&&((u0.initialized<1)||(u0.p_i2<1)))&&(i2.u2.p_sc<1))&&((u0.p_rdy<1)||(i2.u3.access<1)))&&(i2.u3.p_rel<1))) * !(EG((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))))))))
=> equivalent forward existential formula: ([(EY(FwdU(EY(EY(Init)),TRUE)) * !((((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1))))] = FALSE * ([(FwdU((EY(Init) * !(!((E(!(((((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))) U (!((u1.r_moving>=1)) * !(((((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))))) + EG(!(((((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))))))),TRUE) * !(((((((((u0.initialize<1)||(u1.r_stopped<1))&&((i2.u2.move<1)||(u1.r_active<1)))&&(u0.p_rdy<1))&&((u0.initialized<1)||(u0.p_i2<1)))&&(i2.u2.p_sc<1))&&((u0.p_rdy<1)||(i2.u3.access<1)))&&(i2.u3.p_rel<1))))] = FALSE * [FwdG((EY(Init) * !(!((E(!(((((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))) U (!((u1.r_moving>=1)) * !(((((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))))) + EG(!(((((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))))))),(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))] = FALSE))
(forward)formula 3,0,0.067417,5884,1,0,1361,637,434,2363,187,1431,3294
FORMULA RobotManipulation-PT-00001-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((((((((u1.r_moving>=1)||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))) * (EX(AG(EX(((((u0.initialize>=1)&&(u1.r_stopped>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))))) + ((E(EX(((u0.p_rdy>=1)&&(i2.u3.access>=1))) U (((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))) * EX(EX((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1))))) * ((A(((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)) U ((i2.u3.moved>=1)&&(i2.u2.p_m>=1))) + ((((((((((u1.r_moving<1)&&(u0.p_rdy<1))&&(i2.u2.p_sc<1))&&(u0.p_i1<1))&&((u0.initialize<1)||(u1.r_stopped<1)))&&((i2.u2.move<1)||(u1.r_active<1)))&&((u0.initialized<1)||(u0.p_i2<1)))&&((u1.off<1)||(u1.r_active<1)))&&((i2.u3.moved<1)||(i2.u2.p_m<1)))&&(((((((((u0.p_rdy>=1)||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||(u0.p_i1>=1))||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))) + ((u0.p_rdy>=1)&&(((((u1.r_moving>=1)||(i2.u3.access>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))))))))
=> equivalent forward existential formula: ([(EY((EY(Init) * ((((((u1.r_moving>=1)||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))) * !(E(TRUE U !(EX(((((u0.initialize>=1)&&(u1.r_stopped>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1))))))))] != FALSE + (([((((EY(Init) * ((((((u1.r_moving>=1)||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))) * (E(EX(((u0.p_rdy>=1)&&(i2.u3.access>=1))) U (((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))) * EX(EX((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))))) * !(EG(!(((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))))) * !(E(!(((i2.u3.moved>=1)&&(i2.u2.p_m>=1))) U (!(((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))) * !(((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))))))] != FALSE + [(((EY(Init) * ((((((u1.r_moving>=1)||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))) * (E(EX(((u0.p_rdy>=1)&&(i2.u3.access>=1))) U (((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))) * EX(EX((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))))) * ((((((((((u1.r_moving<1)&&(u0.p_rdy<1))&&(i2.u2.p_sc<1))&&(u0.p_i1<1))&&((u0.initialize<1)||(u1.r_stopped<1)))&&((i2.u2.move<1)||(u1.r_active<1)))&&((u0.initialized<1)||(u0.p_i2<1)))&&((u1.off<1)||(u1.r_active<1)))&&((i2.u3.moved<1)||(i2.u2.p_m<1)))&&(((((((((u0.p_rdy>=1)||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||(u0.p_i1>=1))||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))))] != FALSE) + [(((EY(Init) * ((((((u1.r_moving>=1)||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))) * (E(EX(((u0.p_rdy>=1)&&(i2.u3.access>=1))) U (((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))) * EX(EX((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))))) * ((u0.p_rdy>=1)&&(((((u1.r_moving>=1)||(i2.u3.access>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))))] != FALSE))
(forward)formula 4,0,0.101465,6148,1,0,1677,651,523,3055,195,1504,4176
FORMULA RobotManipulation-PT-00001-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(((!(AX((((((u1.off>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))) + AG((EG(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))&&((((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))) + (i2.u3.p_rel<1)))) + ((((EX((((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||(u0.p_rdy>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))) * (!(EF(((((i2.u2.move>=1)&&(u1.r_active>=1))||(u1.r_moving>=1))||((u0.initialized>=1)&&(u0.p_i2>=1))))) + (u0.p_i1<1))) * (!(EF((((((((((i2.u2.move>=1)&&(u1.r_active>=1))||((u1.off>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))) + !(EG((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1))))))) * (((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))) * (((((((((u1.r_moving>=1)||(u0.p_rdy>=1))||(i2.u3.p_rel>=1))||(u0.p_i1>=1))||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1))))))
=> equivalent forward existential formula: (((([((EY(Init) * !((!(!(EX(!((((((u1.off>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))))) + !(E(TRUE U !((EG(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))&&((((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))) + (i2.u3.p_rel<1)))))))) * !(EX((((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||(u0.p_rdy>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))))] = FALSE * [(FwdU(((EY(Init) * !((!(!(EX(!((((((u1.off>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))))) + !(E(TRUE U !((EG(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))&&((((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))) + (i2.u3.p_rel<1)))))))) * !((u0.p_i1<1))),TRUE) * ((((i2.u2.move>=1)&&(u1.r_active>=1))||(u1.r_moving>=1))||((u0.initialized>=1)&&(u0.p_i2>=1))))] = FALSE) * [FwdG(((EY(Init) * !((!(!(EX(!((((((u1.off>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))))) + !(E(TRUE U !((EG(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))&&((((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))) + (i2.u3.p_rel<1)))))))) * !(!(E(TRUE U (((((((((i2.u2.move>=1)&&(u1.r_active>=1))||((u1.off>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))))),(((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1))))] = FALSE) * [((EY(Init) * !((!(!(EX(!((((((u1.off>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))))) + !(E(TRUE U !((EG(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))&&((((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))) + (i2.u3.p_rel<1)))))))) * !((((u0.initialized>=1)&&(u0.p_i2>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))))] = FALSE) * [((EY(Init) * !((!(!(EX(!((((((u1.off>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1))))))) + !(E(TRUE U !((EG(((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))&&((((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(i2.u3.p_rel>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))) + (i2.u3.p_rel<1)))))))) * !((((((((((u1.r_moving>=1)||(u0.p_rdy>=1))||(i2.u3.p_rel>=1))||(u0.p_i1>=1))||((u0.initialize>=1)&&(u1.r_stopped>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))))] = FALSE)
(forward)formula 5,1,0.157927,6412,1,0,1881,667,571,3478,195,1581,4675
FORMULA RobotManipulation-PT-00001-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((!(EF(((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1))))) + !(AX(!(EF((((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1))))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u1.r_moving>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u0.p_rdy>=1)&&(i2.u3.access>=1))))))] != FALSE + [(FwdU(EY(EY(Init)),TRUE) * (((((((((i2.u2.move>=1)&&(u1.r_active>=1))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(u0.p_i1>=1)))] != FALSE)
(forward)formula 6,1,0.163414,6412,1,0,1893,667,580,3503,195,1582,4708
FORMULA RobotManipulation-PT-00001-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((AG((((((((((((((((u0.initialize<1)||(u1.r_stopped<1))&&((i2.u2.move<1)||(u1.r_active<1)))&&(u0.p_rdy<1))&&((u0.initialize<1)||(u1.r_stopped<1)))&&((i2.u2.move<1)||(u1.r_active<1)))&&(u1.r_moving<1))&&(u0.p_rdy<1))&&((u0.initialized<1)||(u0.p_i2<1)))&&(u0.p_i1<1))&&((i2.u2.move<1)||(u1.r_active<1)))&&((u1.off<1)||(u1.r_active<1)))&&(i2.u2.p_sc<1))&&(i2.u3.p_rel<1))||((u0.p_i1>=1)&&(((i2.u2.move>=1)&&(u1.r_active>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))))) + E(AX(((((((((((((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))||((u0.initialize>=1)&&(u1.r_stopped>=1)))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))&&((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))&&(((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))) U EF((((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((((((((((((((((u0.initialize<1)||(u1.r_stopped<1))&&((i2.u2.move<1)||(u1.r_active<1)))&&(u0.p_rdy<1))&&((u0.initialize<1)||(u1.r_stopped<1)))&&((i2.u2.move<1)||(u1.r_active<1)))&&(u1.r_moving<1))&&(u0.p_rdy<1))&&((u0.initialized<1)||(u0.p_i2<1)))&&(u0.p_i1<1))&&((i2.u2.move<1)||(u1.r_active<1)))&&((u1.off<1)||(u1.r_active<1)))&&(i2.u2.p_sc<1))&&(i2.u3.p_rel<1))||((u0.p_i1>=1)&&(((i2.u2.move>=1)&&(u1.r_active>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))))))))] != FALSE + [(FwdU(FwdU(EY(Init),!(EX(!(((((((((((((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||(i2.u2.p_sc>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))||((u0.initialize>=1)&&(u1.r_stopped>=1)))||(u1.r_moving>=1))||((u1.off>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))&&((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(i2.u2.p_sc>=1))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))&&(((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||((u0.initialized>=1)&&(u0.p_i2>=1)))||(u0.p_rdy>=1))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1))))))),TRUE) * (((((((((((u0.initialize>=1)&&(u1.r_stopped>=1))||((i2.u2.move>=1)&&(u1.r_active>=1)))||(u0.p_rdy>=1))||((u0.initialized>=1)&&(u0.p_i2>=1)))||((u1.off>=1)&&(u1.r_active>=1)))||(i2.u2.p_sc>=1))||((i2.u3.moved>=1)&&(i2.u2.p_m>=1)))||(i2.u3.p_rel>=1))||((u0.p_rdy>=1)&&(i2.u3.access>=1)))||(u0.p_i1>=1)))] != FALSE)
(forward)formula 7,1,0.189631,6412,1,0,2405,691,629,4424,198,1763,5851
FORMULA RobotManipulation-PT-00001-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1620946881341

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RobotManipulation-PT-00001, 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 r197-smll-162089451700010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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