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-158897698900297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V10P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698900297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 7.4K Mar 26 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 26 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 25 20:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 25 20:47 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 6.3K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 27K Mar 25 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 25 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 311K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1589228866522

[2020-05-11 20:27:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-11 20:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 20:27:48] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2020-05-11 20:27:48] [INFO ] Transformed 48 places.
[2020-05-11 20:27:48] [INFO ] Transformed 288 transitions.
[2020-05-11 20:27:48] [INFO ] Parsed PT model containing 48 places and 288 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 1109 resets, run finished after 335 ms. (steps per millisecond=298 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1]
[2020-05-11 20:27:49] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2020-05-11 20:27:49] [INFO ] Computed 7 place invariants in 5 ms
[2020-05-11 20:27:49] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-05-11 20:27:49] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-11 20:27:49] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned sat
[2020-05-11 20:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:27:49] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-11 20:27:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:27:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2020-05-11 20:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:27:49] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-05-11 20:27:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 20:27:49] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-05-11 20:27:49] [INFO ] Deduced a trap composed of 14 places in 91 ms
[2020-05-11 20:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2020-05-11 20:27:49] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 26 ms.
[2020-05-11 20:27:50] [INFO ] Added : 83 causal constraints over 18 iterations in 555 ms. Result :sat
[2020-05-11 20:27:50] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-05-11 20:27:50] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-11 20:27:50] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-05-11 20:27:50] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 20:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:27:50] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2020-05-11 20:27:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:27:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 20:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:27:50] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-05-11 20:27:50] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-05-11 20:27:50] [INFO ] Deduced a trap composed of 15 places in 166 ms
[2020-05-11 20:27:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2020-05-11 20:27:50] [INFO ] Computed and/alt/rep : 285/3719/87 causal constraints in 14 ms.
[2020-05-11 20:27:51] [INFO ] Added : 76 causal constraints over 16 iterations in 536 ms. Result :sat
[2020-05-11 20:27:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2020-05-11 20:27:51] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-11 20:27:51] [INFO ] Flatten gal took : 104 ms
FORMULA BridgeAndVehicles-PT-V10P10N10-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-11 20:27:51] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 20:27:51] [INFO ] Applying decomposition
[2020-05-11 20:27:51] [INFO ] Flatten gal took : 42 ms
[2020-05-11 20:27:51] [INFO ] Input system was already deterministic with 288 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/graph4389676272623152074.txt, -o, /tmp/graph4389676272623152074.bin, -w, /tmp/graph4389676272623152074.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/graph4389676272623152074.bin, -l, -1, -v, -w, /tmp/graph4389676272623152074.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 90 out of 288 initially.
// Phase 1: matrix 90 rows 48 cols
[2020-05-11 20:27:51] [INFO ] Computed 7 place invariants in 2 ms
inv : CONTROLEUR_1 + CONTROLEUR_2 + CHOIX_1 + CHOIX_2 + VIDANGE_1 + VIDANGE_2 = 1
inv : SUR_PONT_A + CAPACITE + SUR_PONT_B = 10
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 = 1
inv : ATTENTE_B + SUR_PONT_B + SORTI_B + ROUTE_B = 10
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_10 = 1
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 = 1
inv : ROUTE_A + ATTENTE_A + SUR_PONT_A + SORTI_A = 10
Total of 7 invariants.
[2020-05-11 20:27:51] [INFO ] Computed 7 place invariants in 3 ms
[2020-05-11 20:27:51] [INFO ] Decomposing Gal with order
[2020-05-11 20:27:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 20:27:52] [INFO ] Proved 48 variables to be positive in 201 ms
[2020-05-11 20:27:52] [INFO ] Computing symmetric may disable matrix : 288 transitions.
[2020-05-11 20:27:52] [INFO ] Computation of disable matrix completed :0/288 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:27:52] [INFO ] Computation of Complete disable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:27:52] [INFO ] Computing symmetric may enable matrix : 288 transitions.
[2020-05-11 20:27:52] [INFO ] Removed a total of 488 redundant transitions.
[2020-05-11 20:27:52] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:27:52] [INFO ] Flatten gal took : 272 ms
[2020-05-11 20:27:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 556 labels/synchronizations in 46 ms.
[2020-05-11 20:27:52] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 11 ms
[2020-05-11 20:27:52] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 6 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 10 LTL properties
Checking formula 0 : !((G((!(X("((gi3.gu5.VIDANGE_1+gi3.gu5.VIDANGE_2)<=gi3.gu4.ROUTE_B)")))||(F(G((X(F("((gi3.gu5.VIDANGE_1+gi3.gu5.VIDANGE_2)<=gi3.gu4.ROUTE_B)")))U(X("((gi3.gu5.VIDANGE_1+gi3.gu5.VIDANGE_2)<=gi3.gu4.ROUTE_B)"))))))))
Formula 0 simplified : !G(!X"((gi3.gu5.VIDANGE_1+gi3.gu5.VIDANGE_2)<=gi3.gu4.ROUTE_B)" | FG(XF"((gi3.gu5.VIDANGE_1+gi3.gu5.VIDANGE_2)<=gi3.gu4.ROUTE_B)" U X"((gi3.gu5.VIDANGE_1+gi3.gu5.VIDANGE_2)<=gi3.gu4.ROUTE_B)"))
[2020-05-11 20:27:54] [INFO ] Computing symmetric co enabling matrix : 288 transitions.
[2020-05-11 20:27:55] [INFO ] Computation of co-enabling matrix(3/288) took 810 ms. Total solver calls (SAT/UNSAT): 958(150/808)
[2020-05-11 20:27:58] [INFO ] Computation of co-enabling matrix(21/288) took 4052 ms. Total solver calls (SAT/UNSAT): 5324(282/5042)
[2020-05-11 20:28:02] [INFO ] Computation of co-enabling matrix(38/288) took 7547 ms. Total solver calls (SAT/UNSAT): 9077(523/8554)
[2020-05-11 20:28:05] [INFO ] Computation of co-enabling matrix(44/288) took 10742 ms. Total solver calls (SAT/UNSAT): 10550(523/10027)
[2020-05-11 20:28:08] [INFO ] Computation of co-enabling matrix(65/288) took 13743 ms. Total solver calls (SAT/UNSAT): 15422(523/14899)
[2020-05-11 20:28:11] [INFO ] Computation of co-enabling matrix(73/288) took 17078 ms. Total solver calls (SAT/UNSAT): 17162(523/16639)
[2020-05-11 20:28:14] [INFO ] Computation of co-enabling matrix(92/288) took 20116 ms. Total solver calls (SAT/UNSAT): 21038(523/20515)
[2020-05-11 20:28:17] [INFO ] Computation of co-enabling matrix(102/288) took 23236 ms. Total solver calls (SAT/UNSAT): 22933(523/22410)
[2020-05-11 20:28:20] [INFO ] Computation of co-enabling matrix(139/288) took 26284 ms. Total solver calls (SAT/UNSAT): 29075(523/28552)
[2020-05-11 20:28:23] [INFO ] Computation of co-enabling matrix(214/288) took 29318 ms. Total solver calls (SAT/UNSAT): 37325(523/36802)
[2020-05-11 20:28:26] [INFO ] Computation of co-enabling matrix(282/288) took 32360 ms. Total solver calls (SAT/UNSAT): 39943(523/39420)
[2020-05-11 20:28:27] [INFO ] Computation of Finished co-enabling matrix. took 32630 ms. Total solver calls (SAT/UNSAT): 39953(523/39430)
[2020-05-11 20:28:27] [INFO ] Computing Do-Not-Accords matrix : 288 transitions.
[2020-05-11 20:28:28] [INFO ] Computation of Completed DNA matrix. took 1012 ms. Total solver calls (SAT/UNSAT): 41(0/41)
[2020-05-11 20:28:28] [INFO ] Built C files in 36712ms 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]
Reverse transition relation is NOT exact ! Due to transitions gu1.liberation_A, enregistrement_A_0, basculement_1, basculement_2, liberation_B, enregistrement_B_3, altern_cpt_1_10, altern_cpt_2_10, timeout_A_1_8_0_3, timeout_A_1_6_0_8, timeout_B_2_6_1_0, timeout_B_2_0_2_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/8/12/20
Compilation finished in 3073 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 51 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](( !( X((LTLAP0==true))) ) || ( <>([]((X(<>((LTLAP0==true))))U(X((LTLAP0==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((LTLAP0==true))) ) || ( <>([]((X(<>((LTLAP0==true))))U(X((LTLAP0==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((LTLAP0==true))) ) || ( <>([]((X(<>((LTLAP0==true))))U(X((LTLAP0==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)
Computing Next relation with stutter on 20 deadlock states
423 unique states visited
0 strongly connected components in search stack
425 transitions explored
144 items max in DFS search stack
9810 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,98.1468,1911476,1,0,5278,5.70094e+06,71,3545,3506,8.74913e+06,12228
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(F("((gu3.CHOIX_1+gu3.CHOIX_2)<1)")))||(!(F(G(("((gu3.CHOIX_1+gu3.CHOIX_2)>=1)")U("(gu1.SUR_PONT_A<=gu1.ATTENTE_B)")))))))
Formula 1 simplified : !(!F"((gu3.CHOIX_1+gu3.CHOIX_2)<1)" | !FG("((gu3.CHOIX_1+gu3.CHOIX_2)>=1)" U "(gu1.SUR_PONT_A<=gu1.ATTENTE_B)"))
Computing Next relation with stutter on 20 deadlock states
24 unique states visited
24 strongly connected components in search stack
24 transitions explored
24 items max in DFS search stack
24 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,98.3924,1917584,1,0,5640,5.71484e+06,95,3935,3537,8.77802e+06,13645
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("((gu3.CHOIX_1+gu3.CHOIX_2)<=(gi3.gu5.VIDANGE_1+gi3.gu5.VIDANGE_2))")))
Formula 2 simplified : !F"((gu3.CHOIX_1+gu3.CHOIX_2)<=(gi3.gu5.VIDANGE_1+gi3.gu5.VIDANGE_2))"
Computing Next relation with stutter on 20 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,98.4063,1917848,1,0,5640,5.71484e+06,104,3935,3545,8.77802e+06,13733
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F("(gu1.CAPACITE<=gu1.ATTENTE_B)"))))
Formula 3 simplified : F"(gu1.CAPACITE<=gu1.ATTENTE_B)"
Computing Next relation with stutter on 20 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7065 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,169.066,2212708,1,0,5770,6.75846e+06,22,4028,1447,1.06354e+07,514
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(X(F("(gi3.gu4.ROUTE_B<=gi3.gu4.SUR_PONT_B)"))))||(G(X(G("(gi3.gu4.SUR_PONT_B>=1)"))))))
Formula 4 simplified : !(FXF"(gi3.gu4.ROUTE_B<=gi3.gu4.SUR_PONT_B)" | GXG"(gi3.gu4.SUR_PONT_B>=1)")
Computing Next relation with stutter on 20 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
3739 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,206.464,2223180,1,0,5770,8.23704e+06,42,4028,1736,1.06354e+07,1555
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G("(gi3.gu5.VIDANGE_1>=1)"))))
Formula 5 simplified : !FG"(gi3.gu5.VIDANGE_1>=1)"
Computing Next relation with stutter on 20 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3824 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,244.706,2434072,1,0,5770,8.89317e+06,20,4028,1404,1.16907e+07,1102
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(("((gi3.gu4.ROUTE_A<=gi3.gu4.ROUTE_B)||(gu1.ATTENTE_B>=1))")||((!(F(G("(gi3.gu4.ROUTE_A<=gi3.gu4.ROUTE_B)"))))&&(!(G("(gu1.ATTENTE_B>=1)")))))))
Formula 6 simplified : !G("((gi3.gu4.ROUTE_A<=gi3.gu4.ROUTE_B)||(gu1.ATTENTE_B>=1))" | (!FG"(gi3.gu4.ROUTE_A<=gi3.gu4.ROUTE_B)" & !G"(gu1.ATTENTE_B>=1)"))
Computing Next relation with stutter on 20 deadlock states
145 unique states visited
138 strongly connected components in search stack
146 transitions explored
142 items max in DFS search stack
11593 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,360.668,2675216,1,0,12965,9.44307e+06,38,12781,1418,1.59547e+07,6345
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X((F("(gi2.gu2.SORTI_B>gi2.gu2.CONTROLEUR_2)"))&&(G(X("(gu3.CHOIX_2>gu1.SUR_PONT_A)")))))))
Formula 7 simplified : X(F"(gi2.gu2.SORTI_B>gi2.gu2.CONTROLEUR_2)" & GX"(gu3.CHOIX_2>gu1.SUR_PONT_A)")
Computing Next relation with stutter on 20 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
679 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,367.466,2675216,1,0,12965,9.44307e+06,53,12781,1731,1.59547e+07,6364
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(((X("(gi3.gu4.SUR_PONT_B<=gi3.gu4.ROUTE_B)"))||("(gi3.gu4.SUR_PONT_B<=gi3.gu4.ROUTE_B)"))&&(G("(gu0.COMPTEUR_6<=gu0.ATTENTE_A)")))))
Formula 8 simplified : !G(("(gi3.gu4.SUR_PONT_B<=gi3.gu4.ROUTE_B)" | X"(gi3.gu4.SUR_PONT_B<=gi3.gu4.ROUTE_B)") & G"(gu0.COMPTEUR_6<=gu0.ATTENTE_A)")
Computing Next relation with stutter on 20 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4033 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,407.796,2675216,1,0,12965,9.44307e+06,72,12781,1770,1.59547e+07,7324
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(X(!(X(G(F(X("(gi3.gu4.ROUTE_A>=2)"))))))))||(("(gi3.gu4.ROUTE_A>=2)")U("(gi3.gu4.ROUTE_A<2)"))))
Formula 9 simplified : !(GX!XGFX"(gi3.gu4.ROUTE_A>=2)" | ("(gi3.gu4.ROUTE_A>=2)" U "(gi3.gu4.ROUTE_A<2)"))
Computing Next relation with stutter on 20 deadlock states
251 unique states visited
0 strongly connected components in search stack
498 transitions explored
126 items max in DFS search stack
1924 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,427.041,2675488,1,0,12965,9.44307e+06,82,12781,1776,1.59547e+07,8714
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V10P10N10-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589229318909

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V10P10N10, examination is LTLCardinality"
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-158897698900297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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