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

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

Running Version 0
[2021-05-09 02:11:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 02:11:44] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-09 02:11:44] [INFO ] Transformed 28 places.
[2021-05-09 02:11:44] [INFO ] Transformed 52 transitions.
[2021-05-09 02:11:44] [INFO ] Parsed PT model containing 28 places and 52 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 02:11:44] [INFO ] Initial state test concluded for 4 properties.
FORMULA BridgeAndVehicles-PT-V04P05N02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 10 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:44] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-09 02:11:44] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-09 02:11:45] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
[2021-05-09 02:11:45] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-09 02:11:45] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 02:11:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2021-05-09 02:11:45] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-09 02:11:45] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 02:11:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:45] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2021-05-09 02:11:45] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-09 02:11:45] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 02:11:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 52/52 transitions.
[2021-05-09 02:11:45] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 02:11:45] [INFO ] Flatten gal took : 30 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 02:11:45] [INFO ] Flatten gal took : 9 ms
[2021-05-09 02:11:45] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 100000 steps, including 2296 resets, run finished after 236 ms. (steps per millisecond=423 ) properties (out of 25) seen :18
Running SMT prover for 7 properties.
[2021-05-09 02:11:45] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-09 02:11:45] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 02:11:45] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 02:11:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-09 02:11:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-09 02:11:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-09 02:11:45] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
[2021-05-09 02:11:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-09 02:11:45] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:45] [INFO ] Added : 23 causal constraints over 5 iterations in 42 ms. Result :sat
[2021-05-09 02:11:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-09 02:11:45] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-09 02:11:45] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-09 02:11:45] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-09 02:11:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:46] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 02:11:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-09 02:11:46] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2021-05-09 02:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-09 02:11:46] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 6 ms.
[2021-05-09 02:11:46] [INFO ] Added : 22 causal constraints over 6 iterations in 47 ms. Result :sat
[2021-05-09 02:11:46] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 02:11:46] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-09 02:11:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 02:11:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-09 02:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 02:11:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-09 02:11:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-09 02:11:46] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 3 ms.
[2021-05-09 02:11:46] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2021-05-09 02:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2021-05-09 02:11:46] [INFO ] Added : 17 causal constraints over 4 iterations in 46 ms. Result :sat
[2021-05-09 02:11:46] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
[2021-05-09 02:11:46] [INFO ] Initial state test concluded for 1 properties.
FORMULA BridgeAndVehicles-PT-V04P05N02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(X((p1&&X((p1 U (X(!p1)||G(p1))))))))))], workingDir=/home/mcc/execution]
Support contains 3 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 2 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:46] [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 62 ms to find 1 implicit places.
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 25/28 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/28 places, 52/52 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) p1), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 7}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s15), p1:(GT s7 s6)], 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-00 finished in 604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output 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 3 place count 25 transition count 51
Applied a total of 3 rules in 9 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 72 ms to find 1 implicit places.
[2021-05-09 02:11:46] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:46] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2021-05-09 02:11:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 24/28 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:47] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/28 places, 51/52 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s15 s16) s17), p1:(GT s17 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-03 finished in 307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X((p0 U (p1||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 51
Applied a total of 4 rules in 3 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 78 ms to find 2 implicit places.
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 23/28 places, 51/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 02:11:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/28 places, 51/52 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-06 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:(LEQ (ADD s17 s18) s0)], 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 15 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-06 finished in 246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(!p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 5 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 2 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:47] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
[2021-05-09 02:11:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 25/28 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:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/28 places, 52/52 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-08 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ s24 s17), p1:(GT s18 s15), p0:(LEQ 2 s0)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Knowledge obtained : [p2, (NOT p1), p0]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Support contains 5 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 25/25 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:48] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:48] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
[2021-05-09 02:11:49] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:49] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:49] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 52/52 transitions.
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Product exploration explored 100000 steps with 50000 reset in 259 ms.
[2021-05-09 02:11:49] [INFO ] Flatten gal took : 5 ms
[2021-05-09 02:11:49] [INFO ] Flatten gal took : 6 ms
[2021-05-09 02:11:49] [INFO ] Time to serialize gal into /tmp/LTL1204676903952687397.gal : 2 ms
[2021-05-09 02:11:49] [INFO ] Time to serialize properties into /tmp/LTL8286199508140215601.ltl : 11 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/LTL1204676903952687397.gal, -t, CGAL, -LTL, /tmp/LTL8286199508140215601.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/LTL1204676903952687397.gal -t CGAL -LTL /tmp/LTL8286199508140215601.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(ROUTE_A>=2)")&&(("(SUR_PONT_B<=ATTENTE_B)")U("(COMPTEUR_2<=CHOIX_2)")))))
Formula 0 simplified : !X("(ROUTE_A>=2)" & ("(SUR_PONT_B<=ATTENTE_B)" U "(COMPTEUR_2<=CHOIX_2)"))
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
20 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.225348,23740,1,0,114,32655,126,45,1272,32785,105
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V04P05N02-08 finished in 2574 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 51
Applied a total of 4 rules in 3 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2021-05-09 02:11:49] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:49] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:50] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 78 ms to find 2 implicit places.
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 23/28 places, 51/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/28 places, 51/52 transitions.
Stuttering acceptance computed with spot in 52 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s7), p1:(GT 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-10 finished in 244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(G(p0))||(X(F(p2))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 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 1 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 1 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
[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 1 ms
[2021-05-09 02:11:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[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 1 ms
[2021-05-09 02:11:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:50] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 25/28 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:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/28 places, 52/52 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GT 3 s7) (GT 1 s0)), p0:(GT s6 s12), p2:(GT 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-11 finished in 347 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 214 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 27 /28 variables (removed 1) 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 27 cols
[2021-05-09 02:11:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2021-05-09 02:11:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2021-05-09 02:11:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 02:11:50] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [6, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 99 ms to find 2 implicit places.
[2021-05-09 02:11:50] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 25/28 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:50] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 02:11:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2021-05-09 02:11:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 02:11:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/28 places, 52/52 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-13 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:(LEQ s6 s16), p0:(LEQ s7 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2436 reset in 122 ms.
Product exploration explored 100000 steps with 2435 reset in 118 ms.
Graph (complete) has 189 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2442 reset in 121 ms.
Product exploration explored 100000 steps with 2430 reset in 130 ms.
[2021-05-09 02:11:51] [INFO ] Flatten gal took : 12 ms
[2021-05-09 02:11:51] [INFO ] Flatten gal took : 9 ms
[2021-05-09 02:11:51] [INFO ] Time to serialize gal into /tmp/LTL2190675551531220406.gal : 4 ms
[2021-05-09 02:11:51] [INFO ] Time to serialize properties into /tmp/LTL13168863307567033908.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/LTL2190675551531220406.gal, -t, CGAL, -LTL, /tmp/LTL13168863307567033908.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/LTL2190675551531220406.gal -t CGAL -LTL /tmp/LTL13168863307567033908.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(SORTI_A<=SUR_PONT_B)")||(G("(SUR_PONT_A<=CHOIX_1)"))))))
Formula 0 simplified : !GF("(SORTI_A<=SUR_PONT_B)" | G"(SUR_PONT_A<=CHOIX_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
94 unique states visited
0 strongly connected components in search stack
115 transitions explored
58 items max in DFS search stack
179 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.8243,67300,1,0,3602,180592,132,3254,1258,267819,8031
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V04P05N02-13 finished in 3306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:53] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2021-05-09 02:11:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 02:11:53] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
[2021-05-09 02:11:53] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2021-05-09 02:11:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 02:11:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2021-05-09 02:11:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2021-05-09 02:11:54] [INFO ] Computed 6 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 63 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
[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 ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 26/28 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 1 ms
[2021-05-09 02:11:54] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 2 iterations. Remains : 26/28 places, 52/52 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ s6 s21), p0:(LEQ 3 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2349 reset in 128 ms.
Product exploration explored 100000 steps with 2349 reset in 317 ms.
Graph (complete) has 201 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2351 reset in 135 ms.
Product exploration explored 100000 steps with 2347 reset in 140 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 26/26 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 26 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 23 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2021-05-09 02:11:55] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
[2021-05-09 02:11:55] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 02:11:55] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 02:11:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 02:11:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 52/52 transitions.
Product exploration explored 100000 steps with 2590 reset in 256 ms.
Product exploration explored 100000 steps with 2589 reset in 152 ms.
[2021-05-09 02:11:56] [INFO ] Flatten gal took : 9 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/LTL3206058262600188557.gal : 1 ms
[2021-05-09 02:11:56] [INFO ] Time to serialize properties into /tmp/LTL16091331508031955971.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/LTL3206058262600188557.gal, -t, CGAL, -LTL, /tmp/LTL16091331508031955971.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/LTL3206058262600188557.gal -t CGAL -LTL /tmp/LTL16091331508031955971.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(SUR_PONT_B>=3)")||(G("(ATTENTE_A<=SORTI_B)"))))))
Formula 0 simplified : !XF("(SUR_PONT_B>=3)" | G"(ATTENTE_A<=SORTI_B)")
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
102 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.03811,49364,1,0,604,105229,128,466,1302,153229,1179
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BridgeAndVehicles-PT-V04P05N02-14 finished in 3489 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620526317717

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 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 r026-tajo-162038143500164"
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 [ "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 ;