Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897698900290.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698900290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.4K Mar 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 57K Mar 24 05:37 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 BridgeAndVehicles-PT-V04P05N02-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-15

=== Now, execution of the tool begins

BK_START 1589228799978

[2020-05-11 20:26:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-11 20:26:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 20:26:42] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-05-11 20:26:42] [INFO ] Transformed 28 places.
[2020-05-11 20:26:42] [INFO ] Transformed 52 transitions.
[2020-05-11 20:26:42] [INFO ] Parsed PT model containing 28 places and 52 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2297 resets, run finished after 205 ms. (steps per millisecond=487 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-11 20:26:42] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-05-11 20:26:42] [INFO ] Computed 7 place invariants in 3 ms
[2020-05-11 20:26:42] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
[2020-05-11 20:26:42] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 20:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:42] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-11 20:26:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:26:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 23 ms returned sat
[2020-05-11 20:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:43] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-05-11 20:26:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-11 20:26:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 20:26:43] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 5 ms.
[2020-05-11 20:26:43] [INFO ] Added : 26 causal constraints over 6 iterations in 89 ms. Result :sat
[2020-05-11 20:26:43] [INFO ] [Real]Absence check using 7 positive place invariants in 25 ms returned sat
[2020-05-11 20:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:43] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-05-11 20:26:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:26:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 20:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:43] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-05-11 20:26:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2020-05-11 20:26:43] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2020-05-11 20:26:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 83 ms
[2020-05-11 20:26:43] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-05-11 20:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:43] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2020-05-11 20:26:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 20:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-11 20:26:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:26:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 20:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:43] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-05-11 20:26:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 20:26:43] [INFO ] Deduced a trap composed of 5 places in 37 ms
[2020-05-11 20:26:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2020-05-11 20:26:43] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2020-05-11 20:26:43] [INFO ] Added : 27 causal constraints over 6 iterations in 39 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2020-05-11 20:26:43] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-11 20:26:43] [INFO ] Flatten gal took : 33 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-11 20:26:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-11 20:26:43] [INFO ] Flatten gal took : 9 ms
[2020-05-11 20:26:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 20:26:44] [INFO ] Applying decomposition
[2020-05-11 20:26:44] [INFO ] Flatten gal took : 13 ms
[2020-05-11 20:26:44] [INFO ] Input system was already deterministic with 52 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12112054162445778670.txt, -o, /tmp/graph12112054162445778670.bin, -w, /tmp/graph12112054162445778670.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 28 cols
[2020-05-11 20:26:44] [INFO ] Computed 7 place invariants in 1 ms
inv : SUR_PONT_A + CAPACITE + SUR_PONT_B = 5
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 = 1
inv : ATTENTE_B + SUR_PONT_B + SORTI_B + ROUTE_B = 4
inv : ROUTE_A + ATTENTE_A + SUR_PONT_A + SORTI_A = 4
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 = 1
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 = 1
inv : CONTROLEUR_1 + CONTROLEUR_2 + CHOIX_1 + CHOIX_2 + VIDANGE_1 + VIDANGE_2 = 1
Total of 7 invariants.
[2020-05-11 20:26:44] [INFO ] Computed 7 place invariants in 3 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12112054162445778670.bin, -l, -1, -v, -w, /tmp/graph12112054162445778670.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 20:26:44] [INFO ] Decomposing Gal with order
[2020-05-11 20:26:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 20:26:44] [INFO ] Removed a total of 59 redundant transitions.
[2020-05-11 20:26:44] [INFO ] Flatten gal took : 143 ms
[2020-05-11 20:26:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2020-05-11 20:26:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-11 20:26:44] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !((!(("(u1.SUR_PONT_B<1)")U(!((G(("(u1.SUR_PONT_B>=1)")U("(u1.SUR_PONT_B>=1)")))U(F("(u1.SUR_PONT_B>=1)")))))))
Formula 0 simplified : "(u1.SUR_PONT_B<1)" U !(G"(u1.SUR_PONT_B>=1)" U F"(u1.SUR_PONT_B>=1)")
built 10 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A_0, basculement_1, basculement_2, enregistrement_B_0, decision_0_2, altern_cpt_2_1, timeout_A_1_1_0_1, timeout_A_2_1_0_1, timeout_B_0_2_1_0, u1.liberation_A, u1.liberation_B, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :2/11/11/24
Computing Next relation with stutter on 4 deadlock states
[2020-05-11 20:26:44] [INFO ] Proved 28 variables to be positive in 361 ms
[2020-05-11 20:26:44] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2020-05-11 20:26:44] [INFO ] Computation of disable matrix completed :0/52 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:26:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:26:44] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2020-05-11 20:26:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
59 unique states visited
0 strongly connected components in search stack
58 transitions explored
30 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.133116,21264,1,0,9232,3222,362,12595,381,13648,13725
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(F("((((((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_4>=1))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1)))||((u0.ROUTE_A>=1)&&(u3.NB_ATTENTE_A_0>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_2>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_1>=1)))")))||((!(X(G("(((((((u0.NB_ATTENTE_A_4>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1))||((((u0.NB_ATTENTE_A_1>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))"))))&&((!(F("(((u1.CAPACITE>=5)&&(u2.VIDANGE_1>=1))||((u1.CAPACITE>=5)&&(u3.VIDANGE_2>=1)))")))||(!(X("(((((((u0.NB_ATTENTE_A_4>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1))||((((u0.NB_ATTENTE_A_1>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))")))))))
Formula 1 simplified : !(!F"((((((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_4>=1))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1)))||((u0.ROUTE_A>=1)&&(u3.NB_ATTENTE_A_0>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_2>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_1>=1)))" | (!XG"(((((((u0.NB_ATTENTE_A_4>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1))||((((u0.NB_ATTENTE_A_1>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))" & (!F"(((u1.CAPACITE>=5)&&(u2.VIDANGE_1>=1))||((u1.CAPACITE>=5)&&(u3.VIDANGE_2>=1)))" | !X"(((((((u0.NB_ATTENTE_A_4>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1))||((((u0.NB_ATTENTE_A_1>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))")))
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.139334,23476,1,0,9241,3222,481,12597,406,13648,13832
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F((("(((((((((((((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_0>=1))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_2>=1)))")U((X("(u1.SUR_PONT_B>=1)"))&&("((((((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_4>=1))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1)))||((u0.ROUTE_A>=1)&&(u3.NB_ATTENTE_A_0>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_2>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_1>=1)))")))||(!(X("((((((u0.ROUTE_A<1)||(u0.NB_ATTENTE_A_4<1))&&((u0.ROUTE_A<1)||(u0.NB_ATTENTE_A_3<1)))&&((u0.ROUTE_A<1)||(u3.NB_ATTENTE_A_0<1)))&&((u0.ROUTE_A<1)||(u0.NB_ATTENTE_A_2<1)))&&((u0.ROUTE_A<1)||(u0.NB_ATTENTE_A_1<1)))")))))))
Formula 2 simplified : !XF(("(((((((((((((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_0>=1))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_2>=1)))" U ("((((((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_4>=1))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1)))||((u0.ROUTE_A>=1)&&(u3.NB_ATTENTE_A_0>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_2>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_1>=1)))" & X"(u1.SUR_PONT_B>=1)")) | !X"((((((u0.ROUTE_A<1)||(u0.NB_ATTENTE_A_4<1))&&((u0.ROUTE_A<1)||(u0.NB_ATTENTE_A_3<1)))&&((u0.ROUTE_A<1)||(u3.NB_ATTENTE_A_0<1)))&&((u0.ROUTE_A<1)||(u0.NB_ATTENTE_A_2<1)))&&((u0.ROUTE_A<1)||(u0.NB_ATTENTE_A_1<1)))")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.141514,23476,1,0,9263,3222,539,12604,422,13648,14021
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((((X("(((((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_1>=1)))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_0>=1)))||((u3.CHOIX_1>=1)&&(u2.COMPTEUR_1>=1)))"))&&("((u3.CHOIX_1<1)||(u2.COMPTEUR_2<1))"))&&("((u1.CHOIX_2<1)||(u2.COMPTEUR_2<1))"))U(F(X("(((((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_1>=1)))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_0>=1)))||((u3.CHOIX_1>=1)&&(u2.COMPTEUR_1>=1)))")))))
Formula 3 simplified : !(("((u1.CHOIX_2<1)||(u2.COMPTEUR_2<1))" & "((u3.CHOIX_1<1)||(u2.COMPTEUR_2<1))" & X"(((((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_1>=1)))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_0>=1)))||((u3.CHOIX_1>=1)&&(u2.COMPTEUR_1>=1)))") U FX"(((((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_1>=1)))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_0>=1)))||((u3.CHOIX_1>=1)&&(u2.COMPTEUR_1>=1)))")
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.143764,23476,1,0,9654,3224,577,12862,422,13652,15111
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(G(((!(F("(u1.SUR_PONT_A>=1)")))&&("(u1.SUR_PONT_A<1)"))&&("(((((((((((((((u0.NB_ATTENTE_A_4>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_0>=1))||((((u0.NB_ATTENTE_A_1>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1)))||((((u0.NB_ATTENTE_A_4>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_1>=1)))||((((u0.NB_ATTENTE_A_4>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1)))||((((u0.NB_ATTENTE_A_1>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_0>=1)))||((((u0.NB_ATTENTE_A_1>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_1>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_0>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_0>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_1>=1)))"))))))
Formula 4 simplified : !XXG("(((((((((((((((u0.NB_ATTENTE_A_4>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_0>=1))||((((u0.NB_ATTENTE_A_1>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1)))||((((u0.NB_ATTENTE_A_4>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_1>=1)))||((((u0.NB_ATTENTE_A_4>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1)))||((((u0.NB_ATTENTE_A_1>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_0>=1)))||((((u0.NB_ATTENTE_A_1>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_1>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_0>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_0>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_1>=1)))" & "(u1.SUR_PONT_A<1)" & !F"(u1.SUR_PONT_A>=1)")
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.223209,28488,1,0,22659,3235,698,22828,436,14973,37801
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G("(((((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_1>=1)))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_0>=1)))||((u3.CHOIX_1>=1)&&(u2.COMPTEUR_1>=1)))"))))
Formula 5 simplified : !G"(((((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_1>=1)))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_0>=1)))||((u3.CHOIX_1>=1)&&(u2.COMPTEUR_1>=1)))"
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.227634,28752,1,0,23032,3235,706,23201,436,14985,38808
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G((G(F("((((((((((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_4>=1))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1)))||((u0.ROUTE_A>=1)&&(u3.NB_ATTENTE_A_0>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_2>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_1>=1)))||((((u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u4.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u4.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u4.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u4.ATTENTE_B>=1)))")))&&("(((((((((((((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_0>=1))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_2>=1)))")))))
Formula 6 simplified : !FG("(((((((((((((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_0>=1))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_2>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u2.COMPTEUR_0>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_1>=1)))||((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u2.COMPTEUR_2>=1)))" & GF"((((((((((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_4>=1))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1)))||((u0.ROUTE_A>=1)&&(u3.NB_ATTENTE_A_0>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_2>=1)))||((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_1>=1)))||((((u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&(u4.NB_ATTENTE_B_1>=1))&&(u4.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&(u4.NB_ATTENTE_B_2>=1))&&(u4.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&(u4.NB_ATTENTE_B_3>=1))&&(u4.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(u2.CONTROLEUR_2>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u4.ATTENTE_B>=1)))")
Computing Next relation with stutter on 4 deadlock states
54 unique states visited
54 strongly connected components in search stack
54 transitions explored
54 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.342036,33492,1,0,31427,3274,816,36116,440,15369,61876
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(("(((((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_1>=1)))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_0>=1)))||((u3.CHOIX_1>=1)&&(u2.COMPTEUR_1>=1)))")U(G((!(G("(((((((u0.NB_ATTENTE_A_4>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1))||((((u0.NB_ATTENTE_A_1>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))")))&&("(((u3.CHOIX_1>=1)&&(u2.COMPTEUR_2>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_2>=1)))"))))))
Formula 7 simplified : !G("(((((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_1>=1)))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_0>=1)))||((u3.CHOIX_1>=1)&&(u2.COMPTEUR_1>=1)))" U G("(((u3.CHOIX_1>=1)&&(u2.COMPTEUR_2>=1))||((u1.CHOIX_2>=1)&&(u2.COMPTEUR_2>=1)))" & !G"(((((((u0.NB_ATTENTE_A_4>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1))||((((u0.NB_ATTENTE_A_1>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_2>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u3.CONTROLEUR_1>=1)))"))
Computing Next relation with stutter on 4 deadlock states
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.349702,33736,1,0,32164,3274,850,36658,440,15370,64812
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((!(F(("((((u0.NB_ATTENTE_A_3<1)||(u2.CONTROLEUR_2<1))||(u2.NB_ATTENTE_B_0<1))||(u2.COMPTEUR_1<1))")U("((u3.CHOIX_1<1)||(u2.COMPTEUR_1<1))"))))&&(X(X(((F("((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))"))&&("(u3.CHOIX_1>=1)"))&&("(u2.COMPTEUR_0>=1)")))))))
Formula 8 simplified : !F(!F("((((u0.NB_ATTENTE_A_3<1)||(u2.CONTROLEUR_2<1))||(u2.NB_ATTENTE_B_0<1))||(u2.COMPTEUR_1<1))" U "((u3.CHOIX_1<1)||(u2.COMPTEUR_1<1))") & XX("(u2.COMPTEUR_0>=1)" & "(u3.CHOIX_1>=1)" & F"((u3.CHOIX_1>=1)&&(u2.COMPTEUR_0>=1))"))
Computing Next relation with stutter on 4 deadlock states
51 unique states visited
51 strongly connected components in search stack
51 transitions explored
51 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.387041,36304,1,0,37463,3294,874,40897,441,15411,79261
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(((G(X("(((((u4.NB_ATTENTE_B_1<1)||(u4.ROUTE_B<1))||(u3.CHOIX_1<1))||(u2.COMPTEUR_2<1))&&((u0.ROUTE_A<1)||(u3.NB_ATTENTE_A_0<1)))")))||(G(X("((u3.CHOIX_1>=1)&&(u2.COMPTEUR_2>=1))"))))U("((u0.ROUTE_A>=1)&&(u3.NB_ATTENTE_A_0>=1))"))))
Formula 9 simplified : !X((GX"(((((u4.NB_ATTENTE_B_1<1)||(u4.ROUTE_B<1))||(u3.CHOIX_1<1))||(u2.COMPTEUR_2<1))&&((u0.ROUTE_A<1)||(u3.NB_ATTENTE_A_0<1)))" | GX"((u3.CHOIX_1>=1)&&(u2.COMPTEUR_2>=1))") U "((u0.ROUTE_A>=1)&&(u3.NB_ATTENTE_A_0>=1))")
Computing Next relation with stutter on 4 deadlock states
48 unique states visited
48 strongly connected components in search stack
48 transitions explored
48 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.464873,40264,1,0,45937,3469,916,48544,441,15884,97312
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((!(X((!(X("((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1))")))||("((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_1>=1))"))))||(!(X("((((u0.NB_ATTENTE_A_2>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1))"))))))
Formula 10 simplified : !G(!X("((((u3.NB_ATTENTE_A_0>=1)&&(u3.CONTROLEUR_1>=1))&&(u4.NB_ATTENTE_B_4>=1))&&(u2.COMPTEUR_1>=1))" | !X"((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1))") | !X"((((u0.NB_ATTENTE_A_2>=1)&&(u2.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_0>=1))&&(u2.COMPTEUR_2>=1))")
Computing Next relation with stutter on 4 deadlock states
61 unique states visited
45 strongly connected components in search stack
62 transitions explored
58 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.581614,44224,1,0,53005,3477,984,56494,445,16248,114131
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 20:26:45] [INFO ] Built C files in 1029ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589228805428

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BridgeAndVehicles-PT-V04P05N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897698900290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;