fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143500165
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
344.647 13352.00 24321.00 74.60 TTFTFFTFTFFTFTFF 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-162038143500165.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143500165
=====================================================================

--------------------
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 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 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-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-15

=== Now, execution of the tool begins

BK_START 1620526308768

Running Version 0
[2021-05-09 02:11:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-09 02:11:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 02:11:50] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-09 02:11:50] [INFO ] Transformed 28 places.
[2021-05-09 02:11:50] [INFO ] Transformed 52 transitions.
[2021-05-09 02:11:50] [INFO ] Parsed PT model containing 28 places and 52 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 02:11:50] [INFO ] Initial state test concluded for 2 properties.
FORMULA BridgeAndVehicles-PT-V04P05N02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Applied a total of 2 rules in 8 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-09 02:11:51] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
[2021-05-09 02:11:51] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2021-05-09 02:11:51] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:51] [INFO ] Computed 5 place invariants in 13 ms
[2021-05-09 02:11:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:51] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2021-05-09 02:11:51] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:51] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:51] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/28 places, 52/52 transitions.
[2021-05-09 02:11:51] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 02:11:51] [INFO ] Flatten gal took : 30 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 02:11:51] [INFO ] Flatten gal took : 9 ms
[2021-05-09 02:11:51] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 100000 steps, including 2296 resets, run finished after 320 ms. (steps per millisecond=312 ) properties (out of 16) seen :13
Running SMT prover for 3 properties.
[2021-05-09 02:11:51] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2021-05-09 02:11:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:51] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2021-05-09 02:11:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-09 02:11:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:51] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-09 02:11:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-09 02:11:51] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-09 02:11:51] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2021-05-09 02:11:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2021-05-09 02:11:51] [INFO ] Initial state test concluded for 1 properties.
FORMULA BridgeAndVehicles-PT-V04P05N02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 19 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:11:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:52] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 02:11:52] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
[2021-05-09 02:11:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2021-05-09 02:11:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:52] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 02:11:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:52] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 131 ms to find 2 implicit places.
[2021-05-09 02:11:52] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:11:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:52] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-09 02:11:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 14 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:52] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:11:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:52] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:52] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s7 5) (LT s17 1)) (OR (LT s7 5) (LT s18 1)) (OR (LT s11 1) (LT s19 1)) (OR (LT s10 1) (LT s19 1)) (OR (LT s12 1) (LT s19 1)) (OR (LT s13 1) (LT s19 1)) (OR (LT s14 1) (LT s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7912 reset in 213 ms.
Product exploration explored 100000 steps with 7939 reset in 145 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7902 reset in 129 ms.
Product exploration explored 100000 steps with 7914 reset in 219 ms.
[2021-05-09 02:11:53] [INFO ] Flatten gal took : 5 ms
[2021-05-09 02:11:53] [INFO ] Flatten gal took : 5 ms
[2021-05-09 02:11:53] [INFO ] Time to serialize gal into /tmp/LTL15999604374319956329.gal : 2 ms
[2021-05-09 02:11:53] [INFO ] Time to serialize properties into /tmp/LTL14632204302266353232.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15999604374319956329.gal, -t, CGAL, -LTL, /tmp/LTL14632204302266353232.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15999604374319956329.gal -t CGAL -LTL /tmp/LTL14632204302266353232.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((CAPACITE<5)||(VIDANGE_1<1))&&((CAPACITE<5)||(VIDANGE_2<1)))&&((NB_ATTENTE_B_1<1)||(ROUTE_B<1)))&&((NB_ATTENTE_B_0<1)||(ROUTE_B<1)))&&((NB_ATTENTE_B_2<1)||(ROUTE_B<1)))&&((NB_ATTENTE_B_3<1)||(ROUTE_B<1)))&&((NB_ATTENTE_B_4<1)||(ROUTE_B<1)))"))))
Formula 0 simplified : !GF"((((((((CAPACITE<5)||(VIDANGE_1<1))&&((CAPACITE<5)||(VIDANGE_2<1)))&&((NB_ATTENTE_B_1<1)||(ROUTE_B<1)))&&((NB_ATTENTE_B_0<1)||(ROUTE_B<1)))&&((NB_ATTENTE_B_2<1)||(ROUTE_B<1)))&&((NB_ATTENTE_B_3<1)||(ROUTE_B<1)))&&((NB_ATTENTE_B_4<1)||(ROUTE_B<1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t10, t11, 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/21/51
Computing Next relation with stutter on 4 deadlock states
111 unique states visited
0 strongly connected components in search stack
112 transitions explored
58 items max in DFS search stack
123 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,1.25983,48244,1,0,657,109672,120,454,1211,175359,1882
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BridgeAndVehicles-PT-V04P05N02-00 finished in 2786 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(G((p1&&X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 10 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:54] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
[2021-05-09 02:11:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:54] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 02:11:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2021-05-09 02:11:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:54] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 100 ms to find 2 implicit places.
[2021-05-09 02:11:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:11:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:54] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:11:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s20 1)) (AND (GEQ s10 1) (GEQ s20 1)) (AND (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s13 1) (GEQ s20 1)) (AND (GEQ s14 1) (GEQ s20 1))), p1:(OR (AND (GEQ s7 5) (GEQ s18 1)) (AND (GEQ s7 5) (GEQ s19 1))), p2:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 10 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:56] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:11:56] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:56] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
[2021-05-09 02:11:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:11:56] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:11:56] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-09 02:11:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 52/52 transitions.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
[2021-05-09 02:11:56] [INFO ] Flatten gal took : 6 ms
[2021-05-09 02:11:56] [INFO ] Flatten gal took : 5 ms
[2021-05-09 02:11:56] [INFO ] Time to serialize gal into /tmp/LTL13295449840132144794.gal : 2 ms
[2021-05-09 02:11:56] [INFO ] Time to serialize properties into /tmp/LTL5826680107534884026.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13295449840132144794.gal, -t, CGAL, -LTL, /tmp/LTL5826680107534884026.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13295449840132144794.gal -t CGAL -LTL /tmp/LTL5826680107534884026.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((((((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_0>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))"))||(X(G(("(((CAPACITE>=5)&&(VIDANGE_1>=1))||((CAPACITE>=5)&&(VIDANGE_2>=1)))")&&(X("(SUR_PONT_A>=1)"))))))))
Formula 0 simplified : !X(F"((((((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_0>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))" | XG("(((CAPACITE>=5)&&(VIDANGE_1>=1))||((CAPACITE>=5)&&(VIDANGE_2>=1)))" & X"(SUR_PONT_A>=1)"))
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
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
28 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.287741,24880,1,0,114,34927,112,45,1210,37512,103
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BridgeAndVehicles-PT-V04P05N02-01 finished in 2248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:57] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 65 ms to find 2 implicit places.
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-02 finished in 267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 5 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:57] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 85 ms to find 2 implicit places.
[2021-05-09 02:11:57] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:57] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:11:57] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:57] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10634 reset in 97 ms.
Product exploration explored 100000 steps with 10712 reset in 90 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10645 reset in 85 ms.
Product exploration explored 100000 steps with 10760 reset in 90 ms.
[2021-05-09 02:11:57] [INFO ] Flatten gal took : 6 ms
[2021-05-09 02:11:57] [INFO ] Flatten gal took : 7 ms
[2021-05-09 02:11:58] [INFO ] Time to serialize gal into /tmp/LTL7394524880249435559.gal : 2 ms
[2021-05-09 02:11:58] [INFO ] Time to serialize properties into /tmp/LTL3617750082625670900.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7394524880249435559.gal, -t, CGAL, -LTL, /tmp/LTL3617750082625670900.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7394524880249435559.gal -t CGAL -LTL /tmp/LTL3617750082625670900.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(SUR_PONT_A>=1)")))
Formula 0 simplified : !F"(SUR_PONT_A>=1)"
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t10, t11, t13, t22, t23, t25, t26, t28, t29, t31, t32, t34, t35, t37, t38, t40, t41, t44, t47, t6.t12, t7.t12, t8.t12, t9.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :12/14/25/51
Computing Next relation with stutter on 4 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
33 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.345604,28860,1,0,249,48118,116,127,1137,54993,377
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BridgeAndVehicles-PT-V04P05N02-03 finished in 1113 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 15 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-09 02:11:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:58] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 60 ms to find 1 implicit places.
[2021-05-09 02:11:58] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 24/26 places, 51/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:58] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s9 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s5 1) (GEQ s9 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s5 1) (GEQ s9 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s10 1) (GEQ s22 1))), p0:(AND (OR (LT s7 1) (LT s9 1) (LT s11 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s12 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s13 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s14 1) (LT s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-04 finished in 296 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||G((G(!p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 13 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:58] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 58 ms to find 1 implicit places.
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:58] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), p1, (NOT p2), (NOT p2), (AND (NOT p0) p1 p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR p2 (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s8 1) (LT s14 1) (LT s22 1)) (OR (LT s1 1) (LT s8 1) (LT s14 1) (LT s23 1)) (OR (LT s1 1) (LT s8 1) (LT s13 1) (LT s23 1)) (OR (LT s1 1) (LT s8 1) (LT s14 1) (LT s24 1)) (OR (LT s1 1) (LT s8 1) (LT s13 1) (LT s24 1)) (OR (LT s1 1) (LT s8 1) (LT s13 1) (LT s22 1)) (OR (LT s1 1) (LT s8 1) (LT s11 1) (LT s23 1)) (OR (LT s1 1) (LT s8 1) (LT s11 1) (LT s24 1)) (OR (LT s1 1) (LT s8 1) (LT s12 1) (LT s22 1)) (OR (LT s1 1) (LT s8 1) (LT s11 1) (LT s22 1)) (OR (LT s1 1) (LT s8 1) (LT s12 1) (LT s23 1)) (OR (LT s1 1) (LT s8 1) (LT s12 1) (LT s24 1))), p2:(GEQ s6 1), p1:(AND (OR (LT s7 1) (LT s9 1) (LT s11 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s12 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s13 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s14 1) (LT s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-05 finished in 433 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:59] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
[2021-05-09 02:11:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-09 02:11:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:59] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 73 ms to find 2 implicit places.
[2021-05-09 02:11:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:11:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:11:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5702 reset in 115 ms.
Product exploration explored 100000 steps with 5706 reset in 144 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5717 reset in 99 ms.
Product exploration explored 100000 steps with 5696 reset in 133 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 24/24 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:12:00] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:12:00] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:12:00] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
[2021-05-09 02:12:00] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:12:00] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2021-05-09 02:12:00] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 52/52 transitions.
Product exploration explored 100000 steps with 6312 reset in 207 ms.
Product exploration explored 100000 steps with 6315 reset in 174 ms.
[2021-05-09 02:12:00] [INFO ] Flatten gal took : 5 ms
[2021-05-09 02:12:00] [INFO ] Flatten gal took : 4 ms
[2021-05-09 02:12:00] [INFO ] Time to serialize gal into /tmp/LTL744838075706699003.gal : 5 ms
[2021-05-09 02:12:00] [INFO ] Time to serialize properties into /tmp/LTL7941951482327918931.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL744838075706699003.gal, -t, CGAL, -LTL, /tmp/LTL7941951482327918931.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL744838075706699003.gal -t CGAL -LTL /tmp/LTL7941951482327918931.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(SUR_PONT_B>=1)")))))
Formula 0 simplified : !XXF"(SUR_PONT_B>=1)"
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
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
46 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.475586,29660,1,0,244,51942,118,127,1200,58945,375
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V04P05N02-06 finished in 2119 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 11 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 23 transition count 50
Applied a total of 5 rules in 8 ms. Remains 23 /26 variables (removed 3) and now considering 50/52 (removed 2) transitions.
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 23 cols
[2021-05-09 02:12:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 02:12:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 23 cols
[2021-05-09 02:12:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:12:01] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [6, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 74 ms to find 2 implicit places.
[2021-05-09 02:12:01] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 21 cols
[2021-05-09 02:12:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 02:12:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 21/26 places, 50/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2021-05-09 02:12:01] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 21 cols
[2021-05-09 02:12:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 50/52 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s13 1) (GEQ s20 1)) (AND (GEQ s14 1) (GEQ s20 1))), p0:(OR (AND (GEQ s1 1) (GEQ s6 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s11 1) (GEQ s19 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s11 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s11 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s10 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s10 1) (GEQ s19 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s10 1) (GEQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-07 finished in 236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:12:01] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 74 ms to find 2 implicit places.
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s16 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-10 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 7 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:12:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:12:01] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-09 02:12:01] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:12:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:12:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:12:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)), p1:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s15 1) (GEQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-14 finished in 154 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620526322120

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143500165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;