Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 30K Feb 25 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 592K Feb 25 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 209K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 591K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 73K Feb 25 15:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 368K Feb 25 15:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5M Feb 25 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.0M Feb 25 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.1M Mar 5 18:22 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-V80P50N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678624931854

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 12:42:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 12:42:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:42:13] [INFO ] Load time of PNML (sax parser for PT used): 362 ms
[2023-03-12 12:42:14] [INFO ] Transformed 228 places.
[2023-03-12 12:42:14] [INFO ] Transformed 8588 transitions.
[2023-03-12 12:42:14] [INFO ] Parsed PT model containing 228 places and 8588 transitions and 67470 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 178 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 8588
Applied a total of 2 rules in 151 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:42:14] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:42:14] [INFO ] Computed 5 place invariants in 34 ms
[2023-03-12 12:42:17] [INFO ] Dead Transitions using invariants and state equation in 3028 ms found 0 transitions.
[2023-03-12 12:42:17] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:42:17] [INFO ] Invariant cache hit.
[2023-03-12 12:42:17] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 12:42:17] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:42:17] [INFO ] Invariant cache hit.
[2023-03-12 12:42:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:42:20] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2023-03-12 12:42:20] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:42:20] [INFO ] Invariant cache hit.
[2023-03-12 12:42:22] [INFO ] Dead Transitions using invariants and state equation in 2685 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/228 places, 8588/8588 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8330 ms. Remains : 226/228 places, 8588/8588 transitions.
Support contains 178 out of 226 places after structural reductions.
[2023-03-12 12:42:23] [INFO ] Flatten gal took : 671 ms
[2023-03-12 12:42:24] [INFO ] Flatten gal took : 417 ms
[2023-03-12 12:42:25] [INFO ] Input system was already deterministic with 8588 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 875 ms. (steps per millisecond=11 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 12:42:26] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:42:26] [INFO ] Invariant cache hit.
[2023-03-12 12:42:26] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2023-03-12 12:42:27] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 12:42:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:42:27] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 12:42:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:42:28] [INFO ] After 340ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 12:42:29] [INFO ] After 1165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 322 ms.
[2023-03-12 12:42:29] [INFO ] After 2134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 127 ms.
Support contains 9 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 2999 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:42:32] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:42:32] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:42:35] [INFO ] Dead Transitions using invariants and state equation in 3078 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6081 ms. Remains : 225/226 places, 8587/8588 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-12 12:42:36] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:42:36] [INFO ] Invariant cache hit.
[2023-03-12 12:42:36] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:42:36] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:42:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 12:42:36] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:42:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:42:36] [INFO ] After 147ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:42:37] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-12 12:42:37] [INFO ] After 942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 8587/8587 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 223 transition count 8586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 36 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 221 transition count 8584
Applied a total of 7 rules in 3801 ms. Remains 221 /225 variables (removed 4) and now considering 8584/8587 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3801 ms. Remains : 221/225 places, 8584/8587 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 62650 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62650 steps, saw 21991 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:42:44] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2023-03-12 12:42:44] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-12 12:42:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 12:42:44] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:42:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:42:45] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:42:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:42:45] [INFO ] After 227ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:42:45] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-12 12:42:45] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2924 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2924 ms. Remains : 221/221 places, 8584/8584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2920 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 12:42:51] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:42:51] [INFO ] Invariant cache hit.
[2023-03-12 12:42:52] [INFO ] Implicit Places using invariants in 890 ms returned []
[2023-03-12 12:42:52] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:42:52] [INFO ] Invariant cache hit.
[2023-03-12 12:42:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:42:56] [INFO ] Implicit Places using invariants and state equation in 3508 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4415 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 3141 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10479 ms. Remains : 219/221 places, 8584/8584 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68647 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68647 steps, saw 23970 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:43:02] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2023-03-12 12:43:02] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 12:43:02] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 12:43:03] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:43:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:43:03] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:43:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:43:03] [INFO ] After 232ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:43:04] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-12 12:43:04] [INFO ] After 1054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2984 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2986 ms. Remains : 219/219 places, 8584/8584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 3023 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 12:43:10] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:43:10] [INFO ] Invariant cache hit.
[2023-03-12 12:43:11] [INFO ] Implicit Places using invariants in 981 ms returned []
[2023-03-12 12:43:11] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:43:11] [INFO ] Invariant cache hit.
[2023-03-12 12:43:12] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 2433 ms to find 0 implicit places.
[2023-03-12 12:43:13] [INFO ] Redundant transitions in 1183 ms returned []
[2023-03-12 12:43:13] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:43:13] [INFO ] Invariant cache hit.
[2023-03-12 12:43:16] [INFO ] Dead Transitions using invariants and state equation in 2780 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9429 ms. Remains : 219/219 places, 8584/8584 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 219 transition count 526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 219 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 217 transition count 524
Applied a total of 8062 rules in 33 ms. Remains 217 /219 variables (removed 2) and now considering 524/8584 (removed 8060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 524 rows 217 cols
[2023-03-12 12:43:16] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 12:43:16] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 12:43:16] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:43:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 12:43:17] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:43:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 12:43:17] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:43:17] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 12:43:17] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 169 stabilizing places and 324 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p0)) U X(G((!p0&&X(!p1))))))'
Support contains 85 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 110 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:43:17] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:43:17] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 12:43:20] [INFO ] Dead Transitions using invariants and state equation in 2947 ms found 0 transitions.
[2023-03-12 12:43:20] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:43:20] [INFO ] Invariant cache hit.
[2023-03-12 12:43:21] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2023-03-12 12:43:21] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:43:21] [INFO ] Invariant cache hit.
[2023-03-12 12:43:23] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2492 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 54 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5606 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 372 ms :[true, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s80 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 311 steps with 0 reset in 29 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-00 finished in 6118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 3328 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:43:27] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:43:27] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:43:29] [INFO ] Dead Transitions using invariants and state equation in 2455 ms found 0 transitions.
[2023-03-12 12:43:29] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:43:29] [INFO ] Invariant cache hit.
[2023-03-12 12:43:30] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2023-03-12 12:43:30] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:43:30] [INFO ] Invariant cache hit.
[2023-03-12 12:43:32] [INFO ] Implicit Places using invariants and state equation in 2190 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3432 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 3128 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12343 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-02 automaton TGBA Formula[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:(GEQ s168 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 530 reset in 1814 ms.
Product exploration explored 100000 steps with 536 reset in 1549 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2023-03-12 12:43:40] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2023-03-12 12:43:40] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:43:43] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 12:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:43:44] [INFO ] [Real]Absence check using state equation in 1288 ms returned sat
[2023-03-12 12:43:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:43:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:43:49] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2023-03-12 12:43:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:43:51] [INFO ] [Nat]Added 102 Read/Feed constraints in 2380 ms returned sat
[2023-03-12 12:43:52] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 316 transitions) in 611 ms.
[2023-03-12 12:43:53] [INFO ] Added : 49 causal constraints over 11 iterations in 1493 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2943 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:43:56] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:43:56] [INFO ] Invariant cache hit.
[2023-03-12 12:43:58] [INFO ] Dead Transitions using invariants and state equation in 2638 ms found 0 transitions.
[2023-03-12 12:43:58] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:43:58] [INFO ] Invariant cache hit.
[2023-03-12 12:43:59] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2023-03-12 12:44:00] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:44:00] [INFO ] Invariant cache hit.
[2023-03-12 12:44:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:03] [INFO ] Implicit Places using invariants and state equation in 3506 ms returned []
Implicit Place search using SMT with State Equation took 4683 ms to find 0 implicit places.
[2023-03-12 12:44:04] [INFO ] Redundant transitions in 1270 ms returned []
[2023-03-12 12:44:04] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:44:04] [INFO ] Invariant cache hit.
[2023-03-12 12:44:07] [INFO ] Dead Transitions using invariants and state equation in 2848 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14413 ms. Remains : 223/223 places, 8587/8587 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Finished random walk after 264 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
[2023-03-12 12:44:08] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:44:08] [INFO ] Invariant cache hit.
[2023-03-12 12:44:12] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:44:13] [INFO ] [Real]Absence check using state equation in 1466 ms returned sat
[2023-03-12 12:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:44:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:44:18] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2023-03-12 12:44:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:19] [INFO ] [Nat]Added 102 Read/Feed constraints in 1790 ms returned sat
[2023-03-12 12:44:21] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 316 transitions) in 1148 ms.
[2023-03-12 12:44:21] [INFO ] Added : 49 causal constraints over 11 iterations in 1727 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 533 reset in 1706 ms.
Product exploration explored 100000 steps with 543 reset in 1473 ms.
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2971 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:44:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:44:28] [INFO ] Invariant cache hit.
[2023-03-12 12:44:30] [INFO ] Dead Transitions using invariants and state equation in 2778 ms found 0 transitions.
[2023-03-12 12:44:30] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:44:30] [INFO ] Invariant cache hit.
[2023-03-12 12:44:31] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2023-03-12 12:44:31] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:44:31] [INFO ] Invariant cache hit.
[2023-03-12 12:44:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:34] [INFO ] Implicit Places using invariants and state equation in 3025 ms returned []
Implicit Place search using SMT with State Equation took 4113 ms to find 0 implicit places.
[2023-03-12 12:44:35] [INFO ] Redundant transitions in 875 ms returned []
[2023-03-12 12:44:35] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:44:35] [INFO ] Invariant cache hit.
[2023-03-12 12:44:38] [INFO ] Dead Transitions using invariants and state equation in 2488 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13250 ms. Remains : 223/223 places, 8587/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-02 finished in 75206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 84 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 2895 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:44:41] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:44:41] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-12 12:44:44] [INFO ] Dead Transitions using invariants and state equation in 2796 ms found 0 transitions.
[2023-03-12 12:44:44] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:44] [INFO ] Invariant cache hit.
[2023-03-12 12:44:45] [INFO ] Implicit Places using invariants in 754 ms returned []
[2023-03-12 12:44:45] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:45] [INFO ] Invariant cache hit.
[2023-03-12 12:44:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:48] [INFO ] Implicit Places using invariants and state equation in 2765 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3554 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 3257 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12505 ms. Remains : 225/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-03 automaton TGBA Formula[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 (GEQ s170 1) (OR (AND (GEQ s83 1) (GEQ s85 1) (GEQ s93 1) (GEQ s167 1)) (AND (GEQ s83 1) (GEQ s85 1) (GEQ s132 1) (GEQ s167 1)) (AND (GEQ s83 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 420 reset in 1607 ms.
Product exploration explored 100000 steps with 422 reset in 1392 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 325 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=46 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2023-03-12 12:44:55] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 12:44:55] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-12 12:45:01] [INFO ] [Real]Absence check using 5 positive place invariants in 19 ms returned sat
[2023-03-12 12:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:45:03] [INFO ] [Real]Absence check using state equation in 1351 ms returned sat
[2023-03-12 12:45:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:45:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-12 12:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:45:09] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2023-03-12 12:45:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:45:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 12:45:15] [INFO ] [Nat]Added 102 Read/Feed constraints in 5657 ms returned sat
[2023-03-12 12:45:15] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 317 transitions) in 274 ms.
[2023-03-12 12:45:17] [INFO ] Added : 137 causal constraints over 28 iterations in 1589 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 84 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 8588/8588 transitions.
Applied a total of 0 rules in 2734 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:45:19] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:19] [INFO ] Invariant cache hit.
[2023-03-12 12:45:22] [INFO ] Dead Transitions using invariants and state equation in 2640 ms found 0 transitions.
[2023-03-12 12:45:22] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:22] [INFO ] Invariant cache hit.
[2023-03-12 12:45:23] [INFO ] Implicit Places using invariants in 887 ms returned []
[2023-03-12 12:45:23] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:23] [INFO ] Invariant cache hit.
[2023-03-12 12:45:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:45:25] [INFO ] Implicit Places using invariants and state equation in 2502 ms returned []
Implicit Place search using SMT with State Equation took 3397 ms to find 0 implicit places.
[2023-03-12 12:45:27] [INFO ] Redundant transitions in 1286 ms returned []
[2023-03-12 12:45:27] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:27] [INFO ] Invariant cache hit.
[2023-03-12 12:45:29] [INFO ] Dead Transitions using invariants and state equation in 2685 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12767 ms. Remains : 225/225 places, 8588/8588 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2023-03-12 12:45:30] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:30] [INFO ] Invariant cache hit.
[2023-03-12 12:45:36] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2023-03-12 12:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:45:37] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2023-03-12 12:45:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:45:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2023-03-12 12:45:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:45:44] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2023-03-12 12:45:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:45:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 12:45:47] [INFO ] [Nat]Added 102 Read/Feed constraints in 3213 ms returned sat
[2023-03-12 12:45:48] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 317 transitions) in 411 ms.
[2023-03-12 12:45:50] [INFO ] Added : 119 causal constraints over 24 iterations in 2041 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 424 reset in 1586 ms.
Product exploration explored 100000 steps with 444 reset in 1751 ms.
Support contains 84 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 8588/8588 transitions.
Applied a total of 0 rules in 3098 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:45:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:56] [INFO ] Invariant cache hit.
[2023-03-12 12:45:59] [INFO ] Dead Transitions using invariants and state equation in 2911 ms found 0 transitions.
[2023-03-12 12:45:59] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:59] [INFO ] Invariant cache hit.
[2023-03-12 12:46:00] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-12 12:46:00] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:46:00] [INFO ] Invariant cache hit.
[2023-03-12 12:46:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:46:03] [INFO ] Implicit Places using invariants and state equation in 3035 ms returned []
Implicit Place search using SMT with State Equation took 3802 ms to find 0 implicit places.
[2023-03-12 12:46:04] [INFO ] Redundant transitions in 1276 ms returned []
[2023-03-12 12:46:04] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:46:04] [INFO ] Invariant cache hit.
[2023-03-12 12:46:07] [INFO ] Dead Transitions using invariants and state equation in 2750 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13855 ms. Remains : 225/225 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-03 finished in 88934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 86 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 3155 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:46:11] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:46:11] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-12 12:46:13] [INFO ] Dead Transitions using invariants and state equation in 2829 ms found 0 transitions.
[2023-03-12 12:46:13] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:46:13] [INFO ] Invariant cache hit.
[2023-03-12 12:46:14] [INFO ] Implicit Places using invariants in 726 ms returned []
[2023-03-12 12:46:14] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:46:14] [INFO ] Invariant cache hit.
[2023-03-12 12:46:16] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2281 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 2936 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11205 ms. Remains : 224/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} 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 (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s83 1) (LT s85 1) (LT s93 1) (LT s167 1)) (OR (LT s83 1) (LT s85 1) (LT s132 1) (LT s167 1)) (OR (LT s83 1) (LT s85 1) (LT s142 1) (LT s16...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 153 reset in 3684 ms.
Product exploration explored 100000 steps with 153 reset in 3564 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 399 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 12:46:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2023-03-12 12:46:28] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:46:28] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:46:28] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 530 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 35 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1)))]
Support contains 86 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 3385 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:46:32] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:46:32] [INFO ] Invariant cache hit.
[2023-03-12 12:46:35] [INFO ] Dead Transitions using invariants and state equation in 2679 ms found 0 transitions.
[2023-03-12 12:46:35] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:46:35] [INFO ] Invariant cache hit.
[2023-03-12 12:46:36] [INFO ] Implicit Places using invariants in 827 ms returned []
[2023-03-12 12:46:36] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:46:36] [INFO ] Invariant cache hit.
[2023-03-12 12:46:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:46:40] [INFO ] Implicit Places using invariants and state equation in 4018 ms returned []
Implicit Place search using SMT with State Equation took 4850 ms to find 0 implicit places.
[2023-03-12 12:46:41] [INFO ] Redundant transitions in 1194 ms returned []
[2023-03-12 12:46:41] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:46:41] [INFO ] Invariant cache hit.
[2023-03-12 12:46:44] [INFO ] Dead Transitions using invariants and state equation in 2746 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14869 ms. Remains : 224/224 places, 8587/8587 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:46:45] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:46:45] [INFO ] Invariant cache hit.
[2023-03-12 12:46:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:46:45] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 505 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[false]
Stuttering acceptance computed with spot in 40 ms :[false]
Stuttering acceptance computed with spot in 52 ms :[false]
Product exploration explored 100000 steps with 153 reset in 2098 ms.
Product exploration explored 100000 steps with 153 reset in 1807 ms.
Support contains 3 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 222 transition count 8586
Applied a total of 3 rules in 2909 ms. Remains 222 /224 variables (removed 2) and now considering 8586/8587 (removed 1) transitions.
[2023-03-12 12:46:52] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 222 cols
[2023-03-12 12:46:52] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-12 12:46:54] [INFO ] Implicit Places using invariants in 1244 ms returned []
[2023-03-12 12:46:54] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 12:46:54] [INFO ] Invariant cache hit.
[2023-03-12 12:46:55] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2914 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/224 places, 8586/8587 transitions.
Applied a total of 0 rules in 3237 ms. Remains 221 /221 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9074 ms. Remains : 221/224 places, 8586/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-04 finished in 51663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&F(p1)))'
Support contains 85 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 24 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 223 transition count 8586
Applied a total of 5 rules in 3251 ms. Remains 223 /226 variables (removed 3) and now considering 8586/8588 (removed 2) transitions.
[2023-03-12 12:47:02] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2023-03-12 12:47:02] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 12:47:03] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2023-03-12 12:47:03] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 12:47:03] [INFO ] Invariant cache hit.
[2023-03-12 12:47:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:47:07] [INFO ] Implicit Places using invariants and state equation in 3205 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4299 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/226 places, 8586/8588 transitions.
Applied a total of 0 rules in 3183 ms. Remains 222 /222 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10736 ms. Remains : 222/226 places, 8586/8588 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s80 1)) (A...], 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, null, null][true, true, true]]
Product exploration explored 100000 steps with 381 reset in 1680 ms.
Product exploration explored 100000 steps with 381 reset in 1552 ms.
Computed a total of 165 stabilizing places and 322 stable transitions
Computed a total of 165 stabilizing places and 322 stable transitions
Detected a total of 165/222 stabilizing places and 322/8586 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 536 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[p0, p0]
Finished random walk after 260 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 12 factoid took 626 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
[2023-03-12 12:47:15] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 222 cols
[2023-03-12 12:47:15] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 12:47:18] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-12 12:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:47:19] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2023-03-12 12:47:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:47:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 12:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:47:23] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-12 12:47:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:47:24] [INFO ] [Nat]Added 102 Read/Feed constraints in 1292 ms returned sat
[2023-03-12 12:47:26] [INFO ] Deduced a trap composed of 5 places in 1891 ms of which 1 ms to minimize.
[2023-03-12 12:47:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2914 ms
[2023-03-12 12:47:28] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 315 transitions) in 407 ms.
[2023-03-12 12:47:29] [INFO ] Added : 84 causal constraints over 27 iterations in 1870 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 222 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 8586/8586 transitions.
Applied a total of 0 rules in 2663 ms. Remains 222 /222 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
[2023-03-12 12:47:32] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 12:47:32] [INFO ] Invariant cache hit.
[2023-03-12 12:47:33] [INFO ] Implicit Places using invariants in 908 ms returned []
[2023-03-12 12:47:33] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 12:47:33] [INFO ] Invariant cache hit.
[2023-03-12 12:47:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:47:36] [INFO ] Implicit Places using invariants and state equation in 3283 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4224 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/222 places, 8586/8586 transitions.
Applied a total of 0 rules in 2846 ms. Remains 221 /221 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9735 ms. Remains : 221/222 places, 8586/8586 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
Finished random walk after 260 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=37 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
[2023-03-12 12:47:39] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 221 cols
[2023-03-12 12:47:39] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 12:47:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 12:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:47:44] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2023-03-12 12:47:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:47:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 12:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:47:47] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2023-03-12 12:47:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:47:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 12:47:51] [INFO ] [Nat]Added 102 Read/Feed constraints in 3796 ms returned sat
[2023-03-12 12:47:53] [INFO ] Deduced a trap composed of 5 places in 1334 ms of which 1 ms to minimize.
[2023-03-12 12:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1823 ms
[2023-03-12 12:47:54] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 315 transitions) in 402 ms.
[2023-03-12 12:47:55] [INFO ] Added : 97 causal constraints over 20 iterations in 1405 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 81 ms :[p0]
Product exploration explored 100000 steps with 380 reset in 1549 ms.
Product exploration explored 100000 steps with 381 reset in 1447 ms.
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 8586/8586 transitions.
Applied a total of 0 rules in 2673 ms. Remains 221 /221 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
[2023-03-12 12:48:00] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 12:48:00] [INFO ] Invariant cache hit.
[2023-03-12 12:48:02] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2023-03-12 12:48:02] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 12:48:02] [INFO ] Invariant cache hit.
[2023-03-12 12:48:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:48:10] [INFO ] Implicit Places using invariants and state equation in 8124 ms returned []
Implicit Place search using SMT with State Equation took 9675 ms to find 0 implicit places.
[2023-03-12 12:48:11] [INFO ] Redundant transitions in 1276 ms returned []
[2023-03-12 12:48:11] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 12:48:11] [INFO ] Invariant cache hit.
[2023-03-12 12:48:15] [INFO ] Dead Transitions using invariants and state equation in 4033 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17670 ms. Remains : 221/221 places, 8586/8586 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-05 finished in 76654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(!p0)))'
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 53 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:48:16] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:48:16] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:48:19] [INFO ] Dead Transitions using invariants and state equation in 3235 ms found 0 transitions.
[2023-03-12 12:48:19] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:48:19] [INFO ] Invariant cache hit.
[2023-03-12 12:48:20] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2023-03-12 12:48:20] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:48:20] [INFO ] Invariant cache hit.
[2023-03-12 12:48:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:48:24] [INFO ] Implicit Places using invariants and state equation in 3673 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4891 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 94 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8290 ms. Remains : 224/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-06 finished in 8464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((!p1 U X(p2)))))))'
Support contains 6 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 94 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:48:24] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:48:24] [INFO ] Invariant cache hit.
[2023-03-12 12:48:27] [INFO ] Dead Transitions using invariants and state equation in 3014 ms found 0 transitions.
[2023-03-12 12:48:27] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:48:27] [INFO ] Invariant cache hit.
[2023-03-12 12:48:28] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2023-03-12 12:48:28] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:48:28] [INFO ] Invariant cache hit.
[2023-03-12 12:48:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:48:32] [INFO ] Implicit Places using invariants and state equation in 3670 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4748 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 55 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7916 ms. Remains : 224/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s144 1) (GEQ s172 1)), p1:(LT s82 1), p2:(OR (GEQ s169 1) (AND (GEQ s83 50) (GEQ s170 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 688 reset in 1456 ms.
Product exploration explored 100000 steps with 710 reset in 1572 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/224 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 547 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 321 steps, including 0 resets, run visited all 5 properties in 7 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 12 factoid took 624 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-12 12:48:37] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 224 cols
[2023-03-12 12:48:37] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:48:40] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2023-03-12 12:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:48:42] [INFO ] [Real]Absence check using state equation in 1520 ms returned sat
[2023-03-12 12:48:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:48:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 12:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:48:44] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2023-03-12 12:48:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:48:46] [INFO ] [Nat]Added 102 Read/Feed constraints in 2029 ms returned sat
[2023-03-12 12:48:47] [INFO ] Deduced a trap composed of 5 places in 1108 ms of which 1 ms to minimize.
[2023-03-12 12:48:50] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 4130 ms
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Applied a total of 0 rules in 105 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:48:51] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:48:51] [INFO ] Invariant cache hit.
[2023-03-12 12:48:53] [INFO ] Dead Transitions using invariants and state equation in 2854 ms found 0 transitions.
[2023-03-12 12:48:53] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:48:53] [INFO ] Invariant cache hit.
[2023-03-12 12:48:55] [INFO ] Implicit Places using invariants in 1683 ms returned []
[2023-03-12 12:48:55] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:48:55] [INFO ] Invariant cache hit.
[2023-03-12 12:48:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:49:00] [INFO ] Implicit Places using invariants and state equation in 5079 ms returned []
Implicit Place search using SMT with State Equation took 6784 ms to find 0 implicit places.
[2023-03-12 12:49:00] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:49:00] [INFO ] Invariant cache hit.
[2023-03-12 12:49:03] [INFO ] Dead Transitions using invariants and state equation in 3053 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12803 ms. Remains : 224/224 places, 8588/8588 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/224 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 815 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 324 steps, including 0 resets, run visited all 5 properties in 9 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 12 factoid took 755 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-12 12:49:06] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:49:06] [INFO ] Invariant cache hit.
[2023-03-12 12:49:08] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-12 12:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:49:09] [INFO ] [Real]Absence check using state equation in 1366 ms returned sat
[2023-03-12 12:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:49:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 12:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:49:11] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2023-03-12 12:49:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:49:13] [INFO ] [Nat]Added 102 Read/Feed constraints in 2066 ms returned sat
[2023-03-12 12:49:14] [INFO ] Deduced a trap composed of 5 places in 1037 ms of which 1 ms to minimize.
[2023-03-12 12:49:18] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 4079 ms
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 675 reset in 1524 ms.
Product exploration explored 100000 steps with 690 reset in 1440 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Applied a total of 0 rules in 3208 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:49:24] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:49:24] [INFO ] Invariant cache hit.
[2023-03-12 12:49:27] [INFO ] Dead Transitions using invariants and state equation in 2835 ms found 0 transitions.
[2023-03-12 12:49:28] [INFO ] Redundant transitions in 1131 ms returned []
[2023-03-12 12:49:28] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:49:28] [INFO ] Invariant cache hit.
[2023-03-12 12:49:31] [INFO ] Dead Transitions using invariants and state equation in 2810 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9995 ms. Remains : 224/224 places, 8588/8588 transitions.
Support contains 6 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Applied a total of 0 rules in 46 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:49:31] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:49:31] [INFO ] Invariant cache hit.
[2023-03-12 12:49:34] [INFO ] Dead Transitions using invariants and state equation in 2613 ms found 0 transitions.
[2023-03-12 12:49:34] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:49:34] [INFO ] Invariant cache hit.
[2023-03-12 12:49:35] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2023-03-12 12:49:35] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:49:35] [INFO ] Invariant cache hit.
[2023-03-12 12:49:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:49:41] [INFO ] Implicit Places using invariants and state equation in 5957 ms returned []
Implicit Place search using SMT with State Equation took 6977 ms to find 0 implicit places.
[2023-03-12 12:49:41] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:49:41] [INFO ] Invariant cache hit.
[2023-03-12 12:49:44] [INFO ] Dead Transitions using invariants and state equation in 2938 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12579 ms. Remains : 224/224 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-08 finished in 79991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U !p1)))'
Support contains 6 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 100 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:49:44] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:49:44] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:49:47] [INFO ] Dead Transitions using invariants and state equation in 2575 ms found 0 transitions.
[2023-03-12 12:49:47] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:49:47] [INFO ] Invariant cache hit.
[2023-03-12 12:49:48] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-12 12:49:48] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:49:48] [INFO ] Invariant cache hit.
[2023-03-12 12:49:49] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2272 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 63 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5013 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 185 ms :[p1, p1, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s53 1)), p0:(AND (GEQ s57 1) (GEQ s85 1) (GEQ s86 1) (GEQ s217 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2947 ms.
Product exploration explored 100000 steps with 50000 reset in 2989 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-09 finished in 11430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 10 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 105 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:49:56] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:49:56] [INFO ] Invariant cache hit.
[2023-03-12 12:49:59] [INFO ] Dead Transitions using invariants and state equation in 2807 ms found 0 transitions.
[2023-03-12 12:49:59] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:49:59] [INFO ] Invariant cache hit.
[2023-03-12 12:49:59] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-12 12:49:59] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:49:59] [INFO ] Invariant cache hit.
[2023-03-12 12:50:01] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2480 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 51 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5447 ms. Remains : 224/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s0 1) (LT s3 1) (LT s83 1) (LT s85 1) (LT s134 1) (LT s167 1)), p1:(OR (LT s1 1) (LT s84 1) (LT s90 1) (LT s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2858 ms.
Product exploration explored 100000 steps with 50000 reset in 2831 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-10 finished in 11494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p1)))&&X(F((!p2 U (p3||G(!p2)))))))'
Support contains 6 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 65 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:50:07] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:50:07] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:50:11] [INFO ] Dead Transitions using invariants and state equation in 3581 ms found 0 transitions.
[2023-03-12 12:50:11] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:50:11] [INFO ] Invariant cache hit.
[2023-03-12 12:50:12] [INFO ] Implicit Places using invariants in 1059 ms returned []
[2023-03-12 12:50:12] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:50:12] [INFO ] Invariant cache hit.
[2023-03-12 12:50:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:50:16] [INFO ] Implicit Places using invariants and state equation in 3746 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4827 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 67 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8545 ms. Remains : 224/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (NOT p1), (AND (NOT p3) p2), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s169 1), p1:(AND (GEQ s0 1) (GEQ s60 1)), p3:(AND (NOT (AND (GEQ s83 50) (GEQ s170 1))) (NOT (AND (GEQ s0 1) (GEQ s28 1)))), p2:(AND (GEQ s0 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-11 finished in 8962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||p1) U !(G(p2)||!p1)))'
Support contains 7 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 158 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:50:16] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:50:16] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 12:50:19] [INFO ] Dead Transitions using invariants and state equation in 3199 ms found 0 transitions.
[2023-03-12 12:50:19] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:50:19] [INFO ] Invariant cache hit.
[2023-03-12 12:50:20] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-12 12:50:20] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:50:20] [INFO ] Invariant cache hit.
[2023-03-12 12:50:22] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2517 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 64 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5939 ms. Remains : 224/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) (NOT p0) p2), p2]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 p0), acceptance={0} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s169 1) (GEQ s223 1)), p2:(AND (GEQ s83 1) (GEQ s85 1) (GEQ s157 1) (GEQ s167 1)), p0:(AND (GEQ s83 1) (GEQ s85 1) (GEQ s131 1) (GEQ s167 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-14 finished in 6181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 2982 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:50:25] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:50:25] [INFO ] Invariant cache hit.
[2023-03-12 12:50:28] [INFO ] Dead Transitions using invariants and state equation in 2632 ms found 0 transitions.
[2023-03-12 12:50:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:50:28] [INFO ] Invariant cache hit.
[2023-03-12 12:50:29] [INFO ] Implicit Places using invariants in 904 ms returned []
[2023-03-12 12:50:29] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:50:29] [INFO ] Invariant cache hit.
[2023-03-12 12:50:31] [INFO ] Implicit Places using invariants and state equation in 1980 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2899 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 3412 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11928 ms. Remains : 224/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s22 1) (GEQ s82 1) (GEQ s84 1) (GEQ s85 1))], nbAcceptance=1, 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 648 steps with 0 reset in 17 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLFireability-15 finished in 12058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((!p1 U X(p2)))))))'
[2023-03-12 12:50:35] [INFO ] Flatten gal took : 408 ms
[2023-03-12 12:50:35] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2023-03-12 12:50:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 226 places, 8588 transitions and 67468 arcs took 60 ms.
Total runtime 502380 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1932/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1932/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1932/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1932/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1932/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N50-LTLFireability-02
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N50-LTLFireability-03
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N50-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N50-LTLFireability-05
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N50-LTLFireability-08

BK_STOP 1678625448113

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V80P50N50-LTLFireability-02
ltl formula formula --ltl=/tmp/1932/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 226 places, 8588 transitions and 67468 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1932/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1932/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.940 real 0.370 user 0.290 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1932/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1932/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V80P50N50-LTLFireability-03
ltl formula formula --ltl=/tmp/1932/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 226 places, 8588 transitions and 67468 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.830 real 0.380 user 0.330 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1932/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1932/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1932/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1932/ltl_1_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V80P50N50-LTLFireability-04
ltl formula formula --ltl=/tmp/1932/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 226 places, 8588 transitions and 67468 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.890 real 0.480 user 0.380 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1932/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1932/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1932/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1932/ltl_2_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V80P50N50-LTLFireability-05
ltl formula formula --ltl=/tmp/1932/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 226 places, 8588 transitions and 67468 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.900 real 0.450 user 0.360 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1932/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1932/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1932/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1932/ltl_3_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name BridgeAndVehicles-PT-V80P50N50-LTLFireability-08
ltl formula formula --ltl=/tmp/1932/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 226 places, 8588 transitions and 67468 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.910 real 0.450 user 0.580 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1932/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1932/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1932/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1932/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-V80P50N50"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V80P50N50, 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 r041-tajo-167813694500316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N50.tgz
mv BridgeAndVehicles-PT-V80P50N50 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 ;