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-158897698600129.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698600129
=====================================================================

--------------------
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 1589206986331

[2020-05-11 14:23:08] [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 14:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 14:23:09] [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:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2020-05-11 14:23:09] [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:09] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 107 ms.
[2020-05-11 14:23:09] [INFO ] Computed order based on color domains.
[2020-05-11 14:23:09] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 22 ms.
[2020-05-11 14:23:09] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2297 resets, run finished after 289 ms. (steps per millisecond=346 ) properties seen :[1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-05-11 14:23:10] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-05-11 14:23:10] [INFO ] Computed 7 place invariants in 3 ms
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2020-05-11 14:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-05-11 14:23:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-05-11 14:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:10] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2020-05-11 14:23:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-11 14:23:10] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2020-05-11 14:23:10] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2020-05-11 14:23:10] [INFO ] Added : 28 causal constraints over 6 iterations in 77 ms. Result :sat
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-05-11 14:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-11 14:23:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 14:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:10] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-05-11 14:23:10] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2020-05-11 14:23:10] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 7 ms.
[2020-05-11 14:23:10] [INFO ] Added : 28 causal constraints over 6 iterations in 56 ms. Result :sat
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 29 ms returned unsat
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 14:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:10] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-11 14:23:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 14:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:11] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-05-11 14:23:11] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 14:23:11] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2020-05-11 14:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-05-11 14:23:11] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2020-05-11 14:23:11] [INFO ] Added : 28 causal constraints over 7 iterations in 56 ms. Result :sat
[2020-05-11 14:23:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-05-11 14:23:11] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 14:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:11] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-05-11 14:23:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-05-11 14:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:11] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-05-11 14:23:11] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2020-05-11 14:23:11] [INFO ] Deduced a trap composed of 7 places in 194 ms
[2020-05-11 14:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2020-05-11 14:23:11] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2020-05-11 14:23:11] [INFO ] Added : 24 causal constraints over 6 iterations in 39 ms. Result :sat
[2020-05-11 14:23:11] [INFO ] Deduced a trap composed of 5 places in 10 ms
[2020-05-11 14:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-05-11 14:23:11] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-11 14:23:11] [INFO ] Flatten gal took : 37 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-11 14:23:11] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2020-05-11 14:23:11] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-11 14:23:11] [INFO ] Flatten gal took : 17 ms
[2020-05-11 14:23:11] [INFO ] Input system was already deterministic with 52 transitions.
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:11] [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:11] [INFO ] Computed 7 place invariants in 3 ms
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/graph9828240245501569021.txt, -o, /tmp/graph9828240245501569021.bin, -w, /tmp/graph9828240245501569021.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/graph9828240245501569021.bin, -l, -1, -v, -w, /tmp/graph9828240245501569021.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 14:23:11] [INFO ] Proved 28 variables to be positive in 73 ms
[2020-05-11 14:23:11] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2020-05-11 14:23:11] [INFO ] Computation of disable matrix completed :0/52 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 14:23:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 14:23:11] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2020-05-11 14:23:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 14:23:11] [INFO ] Decomposing Gal with order
[2020-05-11 14:23:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 14:23:11] [INFO ] Removed a total of 121 redundant transitions.
[2020-05-11 14:23:12] [INFO ] Flatten gal took : 68 ms
[2020-05-11 14:23:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 30 ms.
[2020-05-11 14:23:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 13 ms
[2020-05-11 14:23:12] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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 7 LTL properties
Checking formula 0 : !((X(G((F(!(F("((gi2.gu7.VIDANGE_0+gi2.gu7.VIDANGE_1)<=gi2.gu7.ROUTE_B_0)"))))U(G(F("(gi0.gu3.ROUTE_A_0<=gi0.gu1.SORTI_A_0)")))))))
Formula 0 simplified : !XG(F!F"((gi2.gu7.VIDANGE_0+gi2.gu7.VIDANGE_1)<=gi2.gu7.ROUTE_B_0)" U GF"(gi0.gu3.ROUTE_A_0<=gi0.gu1.SORTI_A_0)")
Reverse transition relation is NOT exact ! Due to transitions gi3.gu2.liberation_B, enregistrement_AcA0, liberation_A, basculements0, basculements1, enregistrement_BcB4, altern_cpts0cpt2, altern_cpts1cpt2, timeout_As0cpt1cA0cB3, timeout_As0cpt2cA0cB3, timeout_Bs1cpt1cA1cB0, timeout_Bs1cpt2cA1cB0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/6/12/19
Computing Next relation with stutter on 4 deadlock states
[2020-05-11 14:23:12] [INFO ] Computing symmetric co enabling matrix : 52 transitions.
[2020-05-11 14:23:13] [INFO ] Computation of Finished co-enabling matrix. took 1107 ms. Total solver calls (SAT/UNSAT): 1111(83/1028)
[2020-05-11 14:23:13] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2020-05-11 14:23:13] [INFO ] Computation of Completed DNA matrix. took 99 ms. Total solver calls (SAT/UNSAT): 17(0/17)
[2020-05-11 14:23:13] [INFO ] Built C files in 2138ms 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]
100 unique states visited
0 strongly connected components in search stack
100 transitions explored
58 items max in DFS search stack
208 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,2.09818,58932,1,0,205,218705,67,224,976,220402,802
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(X(X(!(("((gi2.gu5.CHOIX_0+gi2.gu5.CHOIX_1)<=(gi2.gu7.VIDANGE_0+gi2.gu7.VIDANGE_1))")U(F("((gu4.CONTROLEUR_0+gu4.CONTROLEUR_1)>=1)"))))))))
Formula 1 simplified : !FXX!("((gi2.gu5.CHOIX_0+gi2.gu5.CHOIX_1)<=(gi2.gu7.VIDANGE_0+gi2.gu7.VIDANGE_1))" U F"((gu4.CONTROLEUR_0+gu4.CONTROLEUR_1)>=1)")
Computing Next relation with stutter on 4 deadlock states
Compilation finished in 808 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(X(!( ((LTLAP2==true))U(<>((LTLAP3==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(!( ((LTLAP2==true))U(<>((LTLAP3==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(!( ((LTLAP2==true))U(<>((LTLAP3==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)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
120 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,3.29502,88704,1,0,669,364069,80,576,981,421463,1746
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(!(G("(gi0.gu1.SORTI_A_0>=1)"))))))
Formula 2 simplified : !XF!G"(gi0.gu1.SORTI_A_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,3.29595,89020,1,0,669,364069,89,576,982,421463,1750
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X("(gi0.gu1.SORTI_A_0<=(gi2.gu5.CHOIX_0+gi2.gu5.CHOIX_1))"))&&(G(X("(gi0.gu1.SORTI_A_0<=(gi2.gu5.CHOIX_0+gi2.gu5.CHOIX_1))")))))
Formula 3 simplified : !(X"(gi0.gu1.SORTI_A_0<=(gi2.gu5.CHOIX_0+gi2.gu5.CHOIX_1))" & GX"(gi0.gu1.SORTI_A_0<=(gi2.gu5.CHOIX_0+gi2.gu5.CHOIX_1))")
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
65 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,3.94331,104584,1,0,825,445675,97,746,996,499040,2090
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((G((F("(gi3.gu2.SORTI_B_0<3)"))||(G("(gu4.SUR_PONT_A_0<=(gu4.CONTROLEUR_0+gu4.CONTROLEUR_1))"))))U(!(G(F("(gu4.SUR_PONT_A_0<=(gu4.CONTROLEUR_0+gu4.CONTROLEUR_1))")))))))
Formula 4 simplified : !G(G(F"(gi3.gu2.SORTI_B_0<3)" | G"(gu4.SUR_PONT_A_0<=(gu4.CONTROLEUR_0+gu4.CONTROLEUR_1))") U !GF"(gu4.SUR_PONT_A_0<=(gu4.CONTROLEUR_0+gu4.CONTROLEUR_1))")
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
89 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,4.84311,135420,1,0,1244,593573,110,1113,1010,690156,3069
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((X(X(G("(gi0.gu1.SORTI_A_0<=gi0.gu1.ATTENTE_A_0)"))))||("(gu4.SUR_PONT_A_0>=3)"))U(((F("(gi0.gu1.SORTI_A_0<=gi0.gu1.ATTENTE_A_0)"))U("(gi0.gu1.SORTI_A_0<=gi0.gu1.ATTENTE_A_0)"))&&("(gu4.SUR_PONT_A_0>=3)"))))
Formula 5 simplified : !(("(gu4.SUR_PONT_A_0>=3)" | XXG"(gi0.gu1.SORTI_A_0<=gi0.gu1.ATTENTE_A_0)") U ("(gu4.SUR_PONT_A_0>=3)" & (F"(gi0.gu1.SORTI_A_0<=gi0.gu1.ATTENTE_A_0)" U "(gi0.gu1.SORTI_A_0<=gi0.gu1.ATTENTE_A_0)")))
Computing Next relation with stutter on 4 deadlock states
58 unique states visited
58 strongly connected components in search stack
58 transitions explored
58 items max in DFS search stack
47 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,5.30917,145632,1,0,1318,634165,115,1250,1012,785645,3450
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!((F("(gi0.gu1.SORTI_A_0>=1)"))U("(gi0.gu1.SORTI_A_0>=1)")))||(!(X("(gi0.gu3.ATTENTE_B_0<=gi0.gu3.ROUTE_A_0)")))))
Formula 6 simplified : !(!(F"(gi0.gu1.SORTI_A_0>=1)" U "(gi0.gu1.SORTI_A_0>=1)") | !X"(gi0.gu3.ATTENTE_B_0<=gi0.gu3.ROUTE_A_0)")
Computing Next relation with stutter on 4 deadlock states
39 unique states visited
39 strongly connected components in search stack
39 transitions explored
39 items max in DFS search stack
31 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,5.61961,156632,1,0,1556,679431,126,1444,1021,837656,4050
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589206999109

--------------------
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-COL-V04P05N02"
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-COL-V04P05N02, 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-158897698600129"
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 [ "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 ;