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-158897698600130.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-COL-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698600130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.0K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 37K 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-COL-V04P05N02-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-15

=== Now, execution of the tool begins

BK_START 1589206998266

[2020-05-11 14:23:19] [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 14:23:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 14:23:19] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-11 14:23:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 523 ms
[2020-05-11 14:23:20] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2020-05-11 14:23:20] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 15 ms.
[2020-05-11 14:23:20] [INFO ] Computed order based on color domains.
[2020-05-11 14:23:20] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 8 ms.
[2020-05-11 14:23:20] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2296 resets, run finished after 181 ms. (steps per millisecond=552 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
[2020-05-11 14:23:20] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-05-11 14:23:20] [INFO ] Computed 7 place invariants in 3 ms
[2020-05-11 14:23:20] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned unsat
[2020-05-11 14:23:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 14:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:20] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-05-11 14:23:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-11 14:23:20] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 14:23:20] [INFO ] Deduced a trap composed of 6 places in 42 ms
[2020-05-11 14:23:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2020-05-11 14:23:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-05-11 14:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:20] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-05-11 14:23:20] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2020-05-11 14:23:20] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 9 ms.
[2020-05-11 14:23:20] [INFO ] Added : 24 causal constraints over 5 iterations in 88 ms. Result :sat
[2020-05-11 14:23:20] [INFO ] Deduced a trap composed of 6 places in 22 ms
[2020-05-11 14:23:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-05-11 14:23:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 14:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:21] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Real]Added 6 Read/Feed constraints in 4 ms returned sat
[2020-05-11 14:23:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 55 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:21] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 14:23:21] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 7 ms.
[2020-05-11 14:23:21] [INFO ] Added : 21 causal constraints over 5 iterations in 125 ms. Result :sat
[2020-05-11 14:23:21] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-11 14:23:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 54 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:21] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2020-05-11 14:23:21] [INFO ] Deduced a trap composed of 7 places in 33 ms
[2020-05-11 14:23:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2020-05-11 14:23:21] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-11 14:23:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:21] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 28 ms returned sat
[2020-05-11 14:23:21] [INFO ] Deduced a trap composed of 7 places in 53 ms
[2020-05-11 14:23:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2020-05-11 14:23:21] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 14:23:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2020-05-11 14:23:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 14:23:21] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 13 ms.
[2020-05-11 14:23:21] [INFO ] Added : 23 causal constraints over 5 iterations in 50 ms. Result :sat
[2020-05-11 14:23:22] [INFO ] [Real]Absence check using 7 positive place invariants in 38 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-11 14:23:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:22] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 48 ms returned sat
[2020-05-11 14:23:22] [INFO ] Deduced a trap composed of 7 places in 259 ms
[2020-05-11 14:23:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 263 ms
[2020-05-11 14:23:22] [INFO ] [Real]Absence check using 7 positive place invariants in 27 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:22] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2020-05-11 14:23:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2020-05-11 14:23:22] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2020-05-11 14:23:22] [INFO ] Added : 28 causal constraints over 7 iterations in 37 ms. Result :sat
[2020-05-11 14:23:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-05-11 14:23:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 38 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2020-05-11 14:23:22] [INFO ] Deduced a trap composed of 7 places in 11 ms
[2020-05-11 14:23:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2020-05-11 14:23:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 14:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:22] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2020-05-11 14:23:23] [INFO ] [Real]Absence check using 7 positive place invariants in 36 ms returned sat
[2020-05-11 14:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:23] [INFO ] [Real]Absence check using state equation in 154 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-11 14:23:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-11 14:23:23] [INFO ] Flatten gal took : 38 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-11 14:23:23] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 14:23:23] [INFO ] Applying decomposition
[2020-05-11 14:23:23] [INFO ] Flatten gal took : 16 ms
[2020-05-11 14:23:23] [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/graph13799558900392775061.txt, -o, /tmp/graph13799558900392775061.bin, -w, /tmp/graph13799558900392775061.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13799558900392775061.bin, -l, -1, -v, -w, /tmp/graph13799558900392775061.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 14:23:23] [INFO ] Decomposing Gal with order
[2020-05-11 14:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
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 14:23:23] [INFO ] Computed 7 place invariants in 1 ms
inv : SORTI_A_0 + ROUTE_A_0 + ATTENTE_A_0 + SUR_PONT_A_0 = 4
inv : CAPACITE_0 + SUR_PONT_A_0 + SUR_PONT_B_0 = 5
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 = 1
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 = 1
inv : SUR_PONT_B_0 + ATTENTE_B_0 + ROUTE_B_0 + SORTI_B_0 = 4
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 = 1
inv : CONTROLEUR_0 + CONTROLEUR_1 + CHOIX_0 + CHOIX_1 + VIDANGE_0 + VIDANGE_1 = 1
Total of 7 invariants.
[2020-05-11 14:23:23] [INFO ] Computed 7 place invariants in 2 ms
[2020-05-11 14:23:23] [INFO ] Removed a total of 77 redundant transitions.
[2020-05-11 14:23:23] [INFO ] Flatten gal took : 73 ms
[2020-05-11 14:23:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2020-05-11 14:23:23] [INFO ] Proved 28 variables to be positive in 115 ms
[2020-05-11 14:23:23] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2020-05-11 14:23:23] [INFO ] Computation of disable matrix completed :0/52 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 14:23:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 14:23:23] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2020-05-11 14:23:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 14:23:23] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
[2020-05-11 14:23:23] [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 14 LTL properties
Checking formula 0 : !((!(("(u0.SUR_PONT_B_0<1)")U(!((G(("(u0.SUR_PONT_B_0>=1)")U("(u0.SUR_PONT_B_0>=1)")))U(F("(u0.SUR_PONT_B_0>=1)")))))))
Formula 0 simplified : "(u0.SUR_PONT_B_0<1)" U !(G"(u0.SUR_PONT_B_0>=1)" U F"(u0.SUR_PONT_B_0>=1)")
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions enregistrement_AcA0, basculements0, basculements1, enregistrement_BcB0, altern_cpts1cpt2, timeout_As0cpt1cA0cB4, timeout_As0cpt2cA0cB4, timeout_Bs1cpt1cA2cB0, timeout_Bs1cpt2cA2cB0, u0.liberation_A, u0.liberation_B, i3.altern_cpts0cpt2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :2/12/12/26
Computing Next relation with stutter on 4 deadlock states
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.126885,21012,1,0,9120,3578,457,11149,337,10157,15921
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(F("((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((i3.u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))")))||((!(X(G("(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))"))))&&((!(F("(((u0.CAPACITE_0>=5)&&(i3.u1.VIDANGE_1>=1))||((u0.CAPACITE_0>=5)&&(u5.VIDANGE_0>=1)))")))||(!(X("(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))")))))))
Formula 1 simplified : !(!F"((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((i3.u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))" | (!XG"(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))" & (!F"(((u0.CAPACITE_0>=5)&&(i3.u1.VIDANGE_1>=1))||((u0.CAPACITE_0>=5)&&(u5.VIDANGE_0>=1)))" | !X"(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=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.133201,23488,1,0,9130,3578,578,11151,361,10157,16036
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F((("(((((((((((((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))")U((X("(u0.SUR_PONT_B_0>=1)"))&&("((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((i3.u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))")))||(!(X("((((((u2.NB_ATTENTE_A_2<1)||(u2.ROUTE_A_0<1))&&((u2.NB_ATTENTE_A_3<1)||(u2.ROUTE_A_0<1)))&&((u2.NB_ATTENTE_A_4<1)||(u2.ROUTE_A_0<1)))&&((u2.NB_ATTENTE_A_1<1)||(u2.ROUTE_A_0<1)))&&((i3.u1.NB_ATTENTE_A_0<1)||(u2.ROUTE_A_0<1)))")))))))
Formula 2 simplified : !XF(("(((((((((((((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))" U ("((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((i3.u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))" & X"(u0.SUR_PONT_B_0>=1)")) | !X"((((((u2.NB_ATTENTE_A_2<1)||(u2.ROUTE_A_0<1))&&((u2.NB_ATTENTE_A_3<1)||(u2.ROUTE_A_0<1)))&&((u2.NB_ATTENTE_A_4<1)||(u2.ROUTE_A_0<1)))&&((u2.NB_ATTENTE_A_1<1)||(u2.ROUTE_A_0<1)))&&((i3.u1.NB_ATTENTE_A_0<1)||(u2.ROUTE_A_0<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.13548,23488,1,0,9151,3578,636,11158,378,10157,16193
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((((X("(((((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_1>=1))||((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_0>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_1>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_0>=1)))"))&&("((i3.u1.CHOIX_0<1)||(i3.u4.COMPTEUR_2<1))"))&&("((u0.CHOIX_1<1)||(i3.u4.COMPTEUR_2<1))"))U(F(X("(((((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_1>=1))||((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_0>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_1>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_0>=1)))")))))
Formula 3 simplified : !(("((i3.u1.CHOIX_0<1)||(i3.u4.COMPTEUR_2<1))" & "((u0.CHOIX_1<1)||(i3.u4.COMPTEUR_2<1))" & X"(((((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_1>=1))||((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_0>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_1>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_0>=1)))") U FX"(((((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_1>=1))||((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_0>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_1>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_0>=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
1 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.138514,23488,1,0,9551,3578,682,11471,378,10157,17424
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(G(((!(F("(u0.SUR_PONT_A_0>=1)")))&&("(u0.SUR_PONT_A_0<1)"))&&("(((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))"))))))
Formula 4 simplified : !XXG("(((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))" & "(u0.SUR_PONT_A_0<1)" & !F"(u0.SUR_PONT_A_0>=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
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.239079,28500,1,0,22126,3588,815,20530,381,10818,40126
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G("(((((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_1>=1))||((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_0>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_1>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_0>=1)))"))))
Formula 5 simplified : !G"(((((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_1>=1))||((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_0>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_1>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_0>=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.244647,28764,1,0,22511,3588,823,20902,381,10822,41157
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G((G(F("((((((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((i3.u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))")))&&("(((((((((((((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))")))))
Formula 6 simplified : !FG("(((((((((((((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((i3.u1.NB_ATTENTE_A_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(i3.u1.CONTROLEUR_0>=1))&&(i3.u4.COMPTEUR_0>=1)))" & GF"((((((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((i3.u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=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
17 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.406425,34296,1,0,32090,3648,960,34277,388,11191,68259
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(("(((((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_1>=1))||((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_0>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_1>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_0>=1)))")U(G((!(G("(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))")))&&("(((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_2>=1))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_2>=1)))"))))))
Formula 7 simplified : !G("(((((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_1>=1))||((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_0>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_1>=1)))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_0>=1)))" U G("(((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_2>=1))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_2>=1)))" & !G"(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=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
1 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.415461,34540,1,0,32894,3648,996,34804,388,11191,71357
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(("((((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))&&(u0.SUR_PONT_B_0>=1))")U("(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))")))&&(!(F("(((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_2>=1))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_2>=1)))")))))
Formula 8 simplified : !(!("((((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))&&(u0.SUR_PONT_B_0>=1))" U "(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))") & !F"(((i3.u1.CHOIX_0>=1)&&(i3.u4.COMPTEUR_2>=1))||((u0.CHOIX_1>=1)&&(i3.u4.COMPTEUR_2>=1)))")
Computing Next relation with stutter on 4 deadlock states
60 unique states visited
49 strongly connected components in search stack
61 transitions explored
58 items max in DFS search stack
7 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.487283,38748,1,0,42485,3654,1041,42080,388,11333,93211
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F(G(!(X(F(!(X(F(X((F("(((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))"))&&("(((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))")))))))))))))
Formula 9 simplified : FG!XF!XFX("(((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))" & F"(((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))")
Computing Next relation with stutter on 4 deadlock states
[2020-05-11 14:23:25] [INFO ] Computing symmetric co enabling matrix : 52 transitions.
[2020-05-11 14:23:26] [INFO ] Computation of co-enabling matrix(26/52) took 1322 ms. Total solver calls (SAT/UNSAT): 811(83/728)
[2020-05-11 14:23:27] [INFO ] Computation of Finished co-enabling matrix. took 2218 ms. Total solver calls (SAT/UNSAT): 1111(83/1028)
[2020-05-11 14:23:27] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2020-05-11 14:23:27] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 17(0/17)
[2020-05-11 14:23:27] [INFO ] Built C files in 4245ms 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]
Compilation finished in 1614 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>([](!( X(<>(!( X(<>(X(( <>((LTLAP12==true)) ) && ( (LTLAP12==true) ))))) ))) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>([](!( X(<>(!( X(<>(X(( <>((LTLAP12==true)) ) && ( (LTLAP12==true) ))))) ))) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>([](!( X(<>(!( X(<>(X(( <>((LTLAP12==true)) ) && ( (LTLAP12==true) ))))) ))) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
14355 unique states visited
0 strongly connected components in search stack
26212 transitions explored
59 items max in DFS search stack
748 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,7.96895,217232,1,0,317986,3654,1060,471195,391,11363,1053015
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(!(X(G(!(G("(((((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))"))))))))
Formula 10 simplified : !X!XG!G"(((((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_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
15 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,8.12392,221456,1,0,332357,3681,1082,480513,391,11626,1078116
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G(((G("(((((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))"))||(F("(u0.SUR_PONT_A_0>=1)")))U(F(G(X("(u0.SUR_PONT_B_0>=1)"))))))))
Formula 11 simplified : !XG((G"(((((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_3>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_1>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_4>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))||((((u0.CAPACITE_0>=1)&&(u3.NB_ATTENTE_B_2>=1))&&(u3.ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1)))" | F"(u0.SUR_PONT_A_0>=1)") U FGX"(u0.SUR_PONT_B_0>=1)")
Computing Next relation with stutter on 4 deadlock states
59 unique states visited
58 strongly connected components in search stack
60 transitions explored
59 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,8.2149,224604,1,0,338143,3681,1082,486687,391,11664,1092235
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G(((((G(X("(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))")))||("((u3.NB_ATTENTE_B_3>=1)&&(u3.ROUTE_B_0>=1))"))||("((u3.NB_ATTENTE_B_2>=1)&&(u3.ROUTE_B_0>=1))"))||("((u5.NB_ATTENTE_B_0>=1)&&(u3.ROUTE_B_0>=1))"))||("((u3.NB_ATTENTE_B_1>=1)&&(u3.ROUTE_B_0>=1))")))&&(X("(u0.SUR_PONT_B_0>=1)"))))
Formula 12 simplified : !(G("((u3.NB_ATTENTE_B_1>=1)&&(u3.ROUTE_B_0>=1))" | "((u3.NB_ATTENTE_B_2>=1)&&(u3.ROUTE_B_0>=1))" | "((u3.NB_ATTENTE_B_3>=1)&&(u3.ROUTE_B_0>=1))" | "((u5.NB_ATTENTE_B_0>=1)&&(u3.ROUTE_B_0>=1))" | GX"(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))") & X"(u0.SUR_PONT_B_0>=1)")
Computing Next relation with stutter on 4 deadlock states
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
4 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,8.25989,226164,1,0,341807,3681,1139,489821,395,11733,1101417
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X("(((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))"))||(X(!(G(!(G(("(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))")U(F("(u0.SUR_PONT_B_0>=1)"))))))))))
Formula 13 simplified : !(X"(((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(u5.NB_ATTENTE_B_0>=1))&&(u5.CONTROLEUR_1>=1))&&(i3.u4.COMPTEUR_2>=1)))" | X!G!G("(((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(i3.u1.CONTROLEUR_0>=1)))" U F"(u0.SUR_PONT_B_0>=1)"))
Computing Next relation with stutter on 4 deadlock states
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
4 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,8.30064,227484,1,0,343734,3681,1143,492171,395,11733,1104900
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589207013638

--------------------
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-COL-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-COL-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-158897698600130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-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 ;