fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143500161
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V04P05N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
300.943 10377.00 18348.00 45.60 FTTFTFFFTFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143500161.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143500161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 22 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 22 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620754858224

Running Version 0
[2021-05-11 17:41:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 17:41:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 17:41:00] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-11 17:41:00] [INFO ] Transformed 28 places.
[2021-05-11 17:41:00] [INFO ] Transformed 52 transitions.
[2021-05-11 17:41:00] [INFO ] Parsed PT model containing 28 places and 52 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-11 17:41:00] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-11 17:41:00] [INFO ] Computed 7 place invariants in 11 ms
[2021-05-11 17:41:00] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
[2021-05-11 17:41:00] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-11 17:41:00] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-11 17:41:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-11 17:41:00] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-11 17:41:00] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-11 17:41:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-11 17:41:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-11 17:41:00] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-11 17:41:00] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-11 17:41:00] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 52/52 transitions.
[2021-05-11 17:41:00] [INFO ] Flatten gal took : 27 ms
[2021-05-11 17:41:00] [INFO ] Flatten gal took : 10 ms
[2021-05-11 17:41:00] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 100000 steps, including 2295 resets, run finished after 2139 ms. (steps per millisecond=46 ) properties (out of 94) seen :30
Running SMT prover for 64 properties.
[2021-05-11 17:41:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-11 17:41:02] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-11 17:41:03] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-11 17:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 17:41:03] [INFO ] SMT Verify possible in real domain returnedunsat :14 sat :0 real:50
[2021-05-11 17:41:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-11 17:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 17:41:03] [INFO ] [Nat]Absence check using state equation in 30 ms returned unsat :44 sat :20
[2021-05-11 17:41:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-11 17:41:03] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-11 17:41:03] [INFO ] SMT Verify possible in nat domain returned unsat :44 sat :20
Successfully simplified 58 atomic propositions for a total of 15 simplifications.
[2021-05-11 17:41:03] [INFO ] Initial state test concluded for 2 properties.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Applied a total of 0 rules in 6 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-11 17:41:03] [INFO ] Flatten gal took : 4 ms
[2021-05-11 17:41:03] [INFO ] Flatten gal took : 4 ms
[2021-05-11 17:41:03] [INFO ] Input system was already deterministic with 52 transitions.
[2021-05-11 17:41:03] [INFO ] Flatten gal took : 4 ms
[2021-05-11 17:41:03] [INFO ] Flatten gal took : 4 ms
[2021-05-11 17:41:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15150656843355257344.gal : 2 ms
[2021-05-11 17:41:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality12735908010087867134.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality15150656843355257344.gal, -t, CGAL, -ctl, /tmp/CTLCardinality12735908010087867134.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality15150656843355257344.gal -t CGAL -ctl /tmp/CTLCardinality12735908010087867134.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2874,0.0996,8748,2,2847,5,11307,6,0,160,13908,0


Converting to forward existential form...Done !
original formula: !(AG(EF((A(((ROUTE_B+SUR_PONT_B)<=((((((((((((((SUR_PONT_A+SUR_PONT_B)+SORTI_A)+ROUTE_A)+VIDANGE_1)+VIDANGE_2)+CONTROLEUR_1)+CONTROLEUR_2)+NB_ATTENTE_A_0)+NB_ATTENTE_A_1)+NB_ATTENTE_A_2)+NB_ATTENTE_A_3)+NB_ATTENTE_A_4)+CHOIX_1)+CHOIX_2)) U ((((((((ATTENTE_B+SUR_PONT_A)+NB_ATTENTE_B_0)+NB_ATTENTE_B_1)+NB_ATTENTE_B_2)+NB_ATTENTE_B_3)+NB_ATTENTE_B_4)+ATTENTE_A)<=(((((((((((((CAPACITE+CHOIX_1)+CHOIX_2)+SUR_PONT_B)+VIDANGE_1)+VIDANGE_2)+SORTI_B)+ATTENTE_B)+SORTI_A)+COMPTEUR_0)+COMPTEUR_1)+COMPTEUR_2)+CONTROLEUR_1)+CONTROLEUR_2))) + !(EG(((((ROUTE_A+ATTENTE_B)+SUR_PONT_A)+ATTENTE_A)<=(((((ROUTE_A+COMPTEUR_0)+COMPTEUR_1)+COMPTEUR_2)+SORTI_B)+CAPACITE))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!((E(!(((((((((ATTENTE_B+SUR_PONT_A)+NB_ATTENTE_B_0)+NB_ATTENTE_B_1)+NB_ATTENTE_B_2)+NB_ATTENTE_B_3)+NB_ATTENTE_B_4)+ATTENTE_A)<=(((((((((((((CAPACITE+CHOIX_1)+CHOIX_2)+SUR_PONT_B)+VIDANGE_1)+VIDANGE_2)+SORTI_B)+ATTENTE_B)+SORTI_A)+COMPTEUR_0)+COMPTEUR_1)+COMPTEUR_2)+CONTROLEUR_1)+CONTROLEUR_2))) U (!(((ROUTE_B+SUR_PONT_B)<=((((((((((((((SUR_PONT_A+SUR_PONT_B)+SORTI_A)+ROUTE_A)+VIDANGE_1)+VIDANGE_2)+CONTROLEUR_1)+CONTROLEUR_2)+NB_ATTENTE_A_0)+NB_ATTENTE_A_1)+NB_ATTENTE_A_2)+NB_ATTENTE_A_3)+NB_ATTENTE_A_4)+CHOIX_1)+CHOIX_2))) * !(((((((((ATTENTE_B+SUR_PONT_A)+NB_ATTENTE_B_0)+NB_ATTENTE_B_1)+NB_ATTENTE_B_2)+NB_ATTENTE_B_3)+NB_ATTENTE_B_4)+ATTENTE_A)<=(((((((((((((CAPACITE+CHOIX_1)+CHOIX_2)+SUR_PONT_B)+VIDANGE_1)+VIDANGE_2)+SORTI_B)+ATTENTE_B)+SORTI_A)+COMPTEUR_0)+COMPTEUR_1)+COMPTEUR_2)+CONTROLEUR_1)+CONTROLEUR_2))))) + EG(!(((((((((ATTENTE_B+SUR_PONT_A)+NB_ATTENTE_B_0)+NB_ATTENTE_B_1)+NB_ATTENTE_B_2)+NB_ATTENTE_B_3)+NB_ATTENTE_B_4)+ATTENTE_A)<=(((((((((((((CAPACITE+CHOIX_1)+CHOIX_2)+SUR_PONT_B)+VIDANGE_1)+VIDANGE_2)+SORTI_B)+ATTENTE_B)+SORTI_A)+COMPTEUR_0)+COMPTEUR_1)+COMPTEUR_2)+CONTROLEUR_1)+CONTROLEUR_2)))))) + !(EG(((((ROUTE_A+ATTENTE_B)+SUR_PONT_A)+ATTENTE_A)<=(((((ROUTE_A+COMPTEUR_0)+COMPTEUR_1)+COMPTEUR_2)+SORTI_B)+CAPACITE))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t10, t11, t12, t13, t22, t23, t25, t26, t28, t29, t31, t32, t34, t35, t37, t38, t40, t41, t44, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :12/18/22/52
(forward)formula 0,0,1.78882,52320,1,0,398,130294,127,172,14542,188099,414
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 21 transition count 48
Applied a total of 10 rules in 30 ms. Remains 21 /28 variables (removed 7) and now considering 48/52 (removed 4) transitions.
[2021-05-11 17:41:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 17:41:05] [INFO ] Flatten gal took : 6 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 17:41:05] [INFO ] Flatten gal took : 6 ms
[2021-05-11 17:41:05] [INFO ] Input system was already deterministic with 48 transitions.
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 21 transition count 48
Applied a total of 10 rules in 12 ms. Remains 21 /28 variables (removed 7) and now considering 48/52 (removed 4) transitions.
[2021-05-11 17:41:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 17:41:05] [INFO ] Flatten gal took : 5 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 17:41:05] [INFO ] Flatten gal took : 5 ms
[2021-05-11 17:41:05] [INFO ] Input system was already deterministic with 48 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-11 17:41:05] [INFO ] Flatten gal took : 4 ms
[2021-05-11 17:41:05] [INFO ] Flatten gal took : 5 ms
[2021-05-11 17:41:05] [INFO ] Input system was already deterministic with 52 transitions.
[2021-05-11 17:41:05] [INFO ] Flatten gal took : 5 ms
[2021-05-11 17:41:05] [INFO ] Flatten gal took : 5 ms
[2021-05-11 17:41:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality13577851618284909355.gal : 1 ms
[2021-05-11 17:41:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality4299696895118859594.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality13577851618284909355.gal, -t, CGAL, -ctl, /tmp/CTLCardinality4299696895118859594.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality13577851618284909355.gal -t CGAL -ctl /tmp/CTLCardinality4299696895118859594.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2874,0.137145,8636,2,2847,5,11307,6,0,160,13908,0


Converting to forward existential form...Done !
original formula: AF((((((((SUR_PONT_B+NB_ATTENTE_A_3)+NB_ATTENTE_B_3)+ROUTE_B)+VIDANGE_2)>((((((((SORTI_B+NB_ATTENTE_A_0)+NB_ATTENTE_B_0)+NB_ATTENTE_B_1)+COMPTEUR_0)+ROUTE_A)+NB_ATTENTE_A_2)+SORTI_A)+SUR_PONT_A))&&((((((CHOIX_2+NB_ATTENTE_B_1)+SUR_PONT_B)+NB_ATTENTE_B_0)+NB_ATTENTE_A_1)<4)||(((CONTROLEUR_2+NB_ATTENTE_A_3)+NB_ATTENTE_B_0)>(NB_ATTENTE_B_1+NB_ATTENTE_A_2))))&&((CHOIX_1<48)||(((((((SORTI_A+ROUTE_B)+NB_ATTENTE_B_1)+SUR_PONT_B)+NB_ATTENTE_A_4)+SUR_PONT_A)<41)&&((((CHOIX_2+VIDANGE_1)+CHOIX_1)+COMPTEUR_1)>(((((((VIDANGE_2+VIDANGE_1)+ROUTE_A)+NB_ATTENTE_A_1)+CONTROLEUR_2)+NB_ATTENTE_B_0)+COMPTEUR_1)+COMPTEUR_0))))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((SUR_PONT_B+NB_ATTENTE_A_3)+NB_ATTENTE_B_3)+ROUTE_B)+VIDANGE_2)>((((((((SORTI_B+NB_ATTENTE_A_0)+NB_ATTENTE_B_0)+NB_ATTENTE_B_1)+COMPTEUR_0)+ROUTE_A)+NB_ATTENTE_A_2)+SORTI_A)+SUR_PONT_A))&&((((((CHOIX_2+NB_ATTENTE_B_1)+SUR_PONT_B)+NB_ATTENTE_B_0)+NB_ATTENTE_A_1)<4)||(((CONTROLEUR_2+NB_ATTENTE_A_3)+NB_ATTENTE_B_0)>(NB_ATTENTE_B_1+NB_ATTENTE_A_2))))&&((CHOIX_1<48)||(((((((SORTI_A+ROUTE_B)+NB_ATTENTE_B_1)+SUR_PONT_B)+NB_ATTENTE_A_4)+SUR_PONT_A)<41)&&((((CHOIX_2+VIDANGE_1)+CHOIX_1)+COMPTEUR_1)>(((((((VIDANGE_2+VIDANGE_1)+ROUTE_A)+NB_ATTENTE_A_1)+CONTROLEUR_2)+NB_ATTENTE_B_0)+COMPTEUR_1)+COMPTEUR_0)))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/52
(forward)formula 0,0,1.29098,35192,1,0,65,85567,19,3,4046,98507,64
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 21 transition count 48
Applied a total of 10 rules in 15 ms. Remains 21 /28 variables (removed 7) and now considering 48/52 (removed 4) transitions.
[2021-05-11 17:41:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 17:41:06] [INFO ] Flatten gal took : 7 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 17:41:06] [INFO ] Flatten gal took : 6 ms
[2021-05-11 17:41:06] [INFO ] Input system was already deterministic with 48 transitions.
Graph (complete) has 214 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2021-05-11 17:41:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 17:41:06] [INFO ] Flatten gal took : 6 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 17:41:06] [INFO ] Flatten gal took : 6 ms
[2021-05-11 17:41:06] [INFO ] Input system was already deterministic with 52 transitions.
[2021-05-11 17:41:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-11 17:41:06] [INFO ] Flatten gal took : 6 ms
[2021-05-11 17:41:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 17:41:06] [INFO ] Flatten gal took : 6 ms
[2021-05-11 17:41:06] [INFO ] Applying decomposition
[2021-05-11 17:41:06] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6457267000365703088.txt, -o, /tmp/graph6457267000365703088.bin, -w, /tmp/graph6457267000365703088.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6457267000365703088.bin, -l, -1, -v, -w, /tmp/graph6457267000365703088.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 17:41:06] [INFO ] Decomposing Gal with order
[2021-05-11 17:41:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 17:41:06] [INFO ] Removed a total of 62 redundant transitions.
[2021-05-11 17:41:07] [INFO ] Flatten gal took : 33 ms
[2021-05-11 17:41:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 3 ms.
[2021-05-11 17:41:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality16783542008076951633.gal : 2 ms
[2021-05-11 17:41:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality11724134505873144034.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality16783542008076951633.gal, -t, CGAL, -ctl, /tmp/CTLCardinality11724134505873144034.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality16783542008076951633.gal -t CGAL -ctl /tmp/CTLCardinality11724134505873144034.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2874,0.034832,5800,2,1041,5,7760,6,0,171,6206,0


Converting to forward existential form...Done !
original formula: E(AF(((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.ATTENTE_A)<=(((((((((((((((((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.SUR_PONT_B)+gu0.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ROUTE_B)+gu0.SORTI_B)+gu0.ROUTE_A)+gu2.SORTI_A)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4))) U (EX((((((((((((((gu1.CAPACITE+gu1.SUR_PONT_A)+gu1.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu0.ROUTE_A)+gu0.SORTI_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)<=((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.CAPACITE)+gu2.SORTI_A))) * A(((((((((((((((((((gu1.SUR_PONT_A+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.SUR_PONT_B)+gu0.ROUTE_B)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu0.SORTI_B)+gu1.ATTENTE_A)>1)&&(((((((((((((((gu1.SUR_PONT_B+gu1.ATTENTE_B)+gu2.SORTI_A)+gu0.ROUTE_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.SORTI_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)>2)) U AG(((((((((((((((((((gu0.ROUTE_B+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu0.VIDANGE_1)+gu2.VIDANGE_2)+gu1.ATTENTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.CAPACITE)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.SORTI_B)<=(((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.ATTENTE_A)+gu2.SORTI_A)+gu0.ROUTE_A)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2))))))
=> equivalent forward existential formula: [(((FwdU(Init,!(EG(!(((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.ATTENTE_A)<=(((((((((((((((((((((gu1.CHOIX_1+gu1.CHOIX_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.SUR_PONT_B)+gu0.VIDANGE_1)+gu2.VIDANGE_2)+gu0.ROUTE_B)+gu0.SORTI_B)+gu0.ROUTE_A)+gu2.SORTI_A)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)))))) * EX((((((((((((((gu1.CAPACITE+gu1.SUR_PONT_A)+gu1.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu0.ROUTE_A)+gu0.SORTI_B)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)<=((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.CAPACITE)+gu2.SORTI_A)))) * !(EG(!(!(E(TRUE U !(((((((((((((((((((gu0.ROUTE_B+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu0.VIDANGE_1)+gu2.VIDANGE_2)+gu1.ATTENTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.CAPACITE)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.SORTI_B)<=(((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.ATTENTE_A)+gu2.SORTI_A)+gu0.ROUTE_A)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2))))))))) * !(E(!(!(E(TRUE U !(((((((((((((((((((gu0.ROUTE_B+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu0.VIDANGE_1)+gu2.VIDANGE_2)+gu1.ATTENTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.CAPACITE)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.SORTI_B)<=(((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.ATTENTE_A)+gu2.SORTI_A)+gu0.ROUTE_A)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)))))) U (!(((((((((((((((((((gu1.SUR_PONT_A+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.NB_ATTENTE_A_0)+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.SUR_PONT_B)+gu0.ROUTE_B)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu0.SORTI_B)+gu1.ATTENTE_A)>1)&&(((((((((((((((gu1.SUR_PONT_B+gu1.ATTENTE_B)+gu2.SORTI_A)+gu0.ROUTE_A)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.SORTI_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)>2))) * !(!(E(TRUE U !(((((((((((((((((((gu0.ROUTE_B+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu0.VIDANGE_1)+gu2.VIDANGE_2)+gu1.ATTENTE_A)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.CAPACITE)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu0.SORTI_B)<=(((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu1.ATTENTE_A)+gu2.SORTI_A)+gu0.ROUTE_A)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t10, t11, t12, t13, t22, t23, t27, t29, t30, t32, t45, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/10/14/25
(forward)formula 0,0,0.897905,37908,1,0,232,172041,75,83,6094,150643,248
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AG(AX(EF(((gu1.SUR_PONT_B+gu1.ATTENTE_A)>((((((((((((((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)+gu1.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu1.CAPACITE)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu1.SUR_PONT_A))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EX(!(E(TRUE U ((gu1.SUR_PONT_B+gu1.ATTENTE_A)>((((((((((((((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)+gu1.ATTENTE_B)+gu2.COMPTEUR_0)+gu2.COMPTEUR_1)+gu1.COMPTEUR_2)+gu1.NB_ATTENTE_B_0)+gu2.NB_ATTENTE_B_1)+gu2.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu2.NB_ATTENTE_B_4)+gu1.CAPACITE)+gu1.CHOIX_1)+gu1.CHOIX_2)+gu1.SUR_PONT_A))))))))))] != FALSE
(forward)formula 1,0,0.993874,41340,1,0,297,190589,79,120,6288,169357,333
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(E((AG((((((((((((gu1.CONTROLEUR_2+gu1.CONTROLEUR_1)+gu2.NB_ATTENTE_B_2)+gu0.VIDANGE_1)+gu1.CHOIX_1)+gu1.COMPTEUR_2)+gu0.ROUTE_A)+gu0.SORTI_B)+gu1.SUR_PONT_A)+gu0.NB_ATTENTE_A_3)<=(((((((gu1.SUR_PONT_A+gu0.NB_ATTENTE_A_1)+gu1.CHOIX_2)+gu1.ATTENTE_B)+gu1.CONTROLEUR_1)+gu1.ATTENTE_A)+gu1.NB_ATTENTE_B_0)+gu1.CAPACITE))||(((gu1.CONTROLEUR_1+gu1.CHOIX_1)+gu1.SUR_PONT_B)>=23))) * EG((((((((((gu1.ATTENTE_B+gu1.NB_ATTENTE_B_3)+gu2.VIDANGE_2)+gu2.SORTI_A)+gu1.CAPACITE)+gu0.NB_ATTENTE_A_1)+gu2.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_0)+gu2.COMPTEUR_1)<=4))) U (!(EG((((((gu2.COMPTEUR_1+gu0.NB_ATTENTE_A_3)+gu2.COMPTEUR_0)+gu2.SORTI_A)+gu2.VIDANGE_2)>(gu2.NB_ATTENTE_B_1+gu2.NB_ATTENTE_B_2)))) * ((EF((((((gu0.ROUTE_B+gu1.CONTROLEUR_2)+gu1.COMPTEUR_2)+gu1.CHOIX_1)+gu0.NB_ATTENTE_A_0)<=(((gu1.SUR_PONT_B+gu0.VIDANGE_1)+gu1.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_A_2))) + EG((((((gu0.NB_ATTENTE_A_4+gu2.SORTI_A)+gu2.COMPTEUR_0)+gu0.VIDANGE_1)+gu0.NB_ATTENTE_A_1)<=gu2.NB_ATTENTE_B_2))) + (gu0.ROUTE_A<=((((gu1.CONTROLEUR_2+gu2.SORTI_A)+gu1.ATTENTE_B)+gu1.SUR_PONT_B)+gu1.CHOIX_1))))) U AG(!(A((((((gu1.SUR_PONT_A+gu1.SUR_PONT_B)+gu0.NB_ATTENTE_A_2)+gu2.VIDANGE_2)<=((((gu0.NB_ATTENTE_A_0+gu1.ATTENTE_A)+gu1.NB_ATTENTE_B_3)+gu1.SUR_PONT_A)+gu2.NB_ATTENTE_B_4))||(((gu0.VIDANGE_1+gu1.ATTENTE_A)+gu1.CONTROLEUR_1)>=44)) U (((gu1.NB_ATTENTE_B_3+gu1.CHOIX_1)+gu0.ROUTE_B)<=(gu1.COMPTEUR_2+gu0.NB_ATTENTE_A_4))))))
=> equivalent forward existential formula: [(FwdU(Init,E((!(E(TRUE U !((((((((((((gu1.CONTROLEUR_2+gu1.CONTROLEUR_1)+gu2.NB_ATTENTE_B_2)+gu0.VIDANGE_1)+gu1.CHOIX_1)+gu1.COMPTEUR_2)+gu0.ROUTE_A)+gu0.SORTI_B)+gu1.SUR_PONT_A)+gu0.NB_ATTENTE_A_3)<=(((((((gu1.SUR_PONT_A+gu0.NB_ATTENTE_A_1)+gu1.CHOIX_2)+gu1.ATTENTE_B)+gu1.CONTROLEUR_1)+gu1.ATTENTE_A)+gu1.NB_ATTENTE_B_0)+gu1.CAPACITE))||(((gu1.CONTROLEUR_1+gu1.CHOIX_1)+gu1.SUR_PONT_B)>=23))))) * EG((((((((((gu1.ATTENTE_B+gu1.NB_ATTENTE_B_3)+gu2.VIDANGE_2)+gu2.SORTI_A)+gu1.CAPACITE)+gu0.NB_ATTENTE_A_1)+gu2.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_0)+gu2.COMPTEUR_1)<=4))) U (!(EG((((((gu2.COMPTEUR_1+gu0.NB_ATTENTE_A_3)+gu2.COMPTEUR_0)+gu2.SORTI_A)+gu2.VIDANGE_2)>(gu2.NB_ATTENTE_B_1+gu2.NB_ATTENTE_B_2)))) * ((E(TRUE U (((((gu0.ROUTE_B+gu1.CONTROLEUR_2)+gu1.COMPTEUR_2)+gu1.CHOIX_1)+gu0.NB_ATTENTE_A_0)<=(((gu1.SUR_PONT_B+gu0.VIDANGE_1)+gu1.NB_ATTENTE_B_3)+gu0.NB_ATTENTE_A_2))) + EG((((((gu0.NB_ATTENTE_A_4+gu2.SORTI_A)+gu2.COMPTEUR_0)+gu0.VIDANGE_1)+gu0.NB_ATTENTE_A_1)<=gu2.NB_ATTENTE_B_2))) + (gu0.ROUTE_A<=((((gu1.CONTROLEUR_2+gu2.SORTI_A)+gu1.ATTENTE_B)+gu1.SUR_PONT_B)+gu1.CHOIX_1)))))) * !(E(TRUE U !(!(!((E(!((((gu1.NB_ATTENTE_B_3+gu1.CHOIX_1)+gu0.ROUTE_B)<=(gu1.COMPTEUR_2+gu0.NB_ATTENTE_A_4))) U (!((((((gu1.SUR_PONT_A+gu1.SUR_PONT_B)+gu0.NB_ATTENTE_A_2)+gu2.VIDANGE_2)<=((((gu0.NB_ATTENTE_A_0+gu1.ATTENTE_A)+gu1.NB_ATTENTE_B_3)+gu1.SUR_PONT_A)+gu2.NB_ATTENTE_B_4))||(((gu0.VIDANGE_1+gu1.ATTENTE_A)+gu1.CONTROLEUR_1)>=44))) * !((((gu1.NB_ATTENTE_B_3+gu1.CHOIX_1)+gu0.ROUTE_B)<=(gu1.COMPTEUR_2+gu0.NB_ATTENTE_A_4))))) + EG(!((((gu1.NB_ATTENTE_B_3+gu1.CHOIX_1)+gu0.ROUTE_B)<=(gu1.COMPTEUR_2+gu0.NB_ATTENTE_A_4)))))))))))] != FALSE
(forward)formula 2,0,1.10542,43188,1,0,392,200363,88,171,6416,178706,436
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EX((((((((gu0.SORTI_B+gu2.NB_ATTENTE_B_4)+gu1.CAPACITE)+gu2.NB_ATTENTE_B_1)+gu0.ROUTE_A)+gu0.NB_ATTENTE_A_2)+gu2.VIDANGE_2)<=8)))
=> equivalent forward existential formula: [FwdG(Init,EX((((((((gu0.SORTI_B+gu2.NB_ATTENTE_B_4)+gu1.CAPACITE)+gu2.NB_ATTENTE_B_1)+gu0.ROUTE_A)+gu0.NB_ATTENTE_A_2)+gu2.VIDANGE_2)<=8)))] != FALSE
dead was empty
(forward)formula 3,0,1.2889,44772,1,0,397,210317,89,174,6482,186840,441
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1620754868601

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143500161"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;