About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7660.804 | 3600000.00 | 13830738.00 | 977.90 | FFTTFTFTFTFT?TTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918200203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.8K Apr 29 21:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 21:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 99K Apr 29 21:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 29 21:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 434K May 10 09:33 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-V20P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652585152729
Running Version 202205111006
[2022-05-15 03:25:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 03:25:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 03:25:54] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2022-05-15 03:25:54] [INFO ] Transformed 68 places.
[2022-05-15 03:25:54] [INFO ] Transformed 548 transitions.
[2022-05-15 03:25:54] [INFO ] Parsed PT model containing 68 places and 548 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:25:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 03:25:54] [INFO ] Computed 7 place invariants in 13 ms
[2022-05-15 03:25:54] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
[2022-05-15 03:25:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 03:25:54] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-15 03:25:54] [INFO ] Implicit Places using invariants in 105 ms returned []
[2022-05-15 03:25:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 03:25:54] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 03:25:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:25:54] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2022-05-15 03:25:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 03:25:54] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 03:25:55] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 548/548 transitions.
Support contains 16 out of 68 places after structural reductions.
[2022-05-15 03:25:55] [INFO ] Flatten gal took : 74 ms
[2022-05-15 03:25:55] [INFO ] Flatten gal took : 42 ms
[2022-05-15 03:25:55] [INFO ] Input system was already deterministic with 548 transitions.
Support contains 15 out of 68 places (down from 16) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2022-05-15 03:25:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 03:25:56] [INFO ] Computed 7 place invariants in 10 ms
[2022-05-15 03:25:56] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-15 03:25:56] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-15 03:25:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 03:25:56] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-15 03:25:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:25:56] [INFO ] After 30ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-15 03:25:56] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-05-15 03:25:56] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 66 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:25:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:25:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:25:56] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/68 places, 547/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 747166 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :{}
Probabilistic random walk after 747166 steps, saw 181265 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:26:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:00] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 03:26:00] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-05-15 03:26:00] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:26:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:26:00] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:26:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:00] [INFO ] After 24ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:26:00] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-15 03:26:00] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 25 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:26:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:00] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-15 03:26:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:00] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 354 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/65 places, 547/547 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 783642 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 783642 steps, saw 190726 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:26:03] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:03] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:03] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:26:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:04] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:26:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:04] [INFO ] After 31ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:26:04] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-15 03:26:04] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 17 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:26:04] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2022-05-15 03:26:04] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:04] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2022-05-15 03:26:04] [INFO ] Redundant transitions in 38 ms returned []
[2022-05-15 03:26:04] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:04] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 63 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 61 transition count 127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 424 place count 61 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 426 place count 59 transition count 125
Applied a total of 426 rules in 14 ms. Remains 59 /63 variables (removed 4) and now considering 125/547 (removed 422) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 59 cols
[2022-05-15 03:26:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:04] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:26:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2022-05-15 03:26:04] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:26:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 03:26:04] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:26:04] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-15 03:26:04] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:26:04] [INFO ] Flatten gal took : 9 ms
[2022-05-15 03:26:04] [INFO ] Flatten gal took : 8 ms
[2022-05-15 03:26:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1255603981783802459.gal : 2 ms
[2022-05-15 03:26:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8246650768161990382.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3108017481656375523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1255603981783802459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8246650768161990382.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8246650768161990382.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 420
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :420 after 3528
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3528 after 23520
Reachability property AtomicPropp7 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :23520 after 168546
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :168546 after 212562
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :212562 after 461496
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :461496 after 1.28054e+06
Reachability property AtomicPropp20 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.52229e+06,0.321339,16196,2,6750,18,75131,6,0,368,37981,0
Total reachable state count : 5522286
Verifying 2 reachability properties.
Reachability property AtomicPropp7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,840,0.322002,16460,2,101,18,75131,7,0,371,37981,0
Reachability property AtomicPropp20 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,126,0.322469,16460,2,94,18,75131,8,0,375,37981,0
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 15 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:26:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:05] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
[2022-05-15 03:26:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:05] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:05] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-05-15 03:26:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:05] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2022-05-15 03:26:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:26:06] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 547/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 3 s53), p1:(GT s48 s22)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01 finished in 929 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 9 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:26:06] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:06] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2022-05-15 03:26:06] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:06] [INFO ] Implicit Places using invariants in 110 ms returned []
[2022-05-15 03:26:06] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:26:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:06] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 353 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 547/548 transitions.
Applied a total of 0 rules in 9 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT s23 s51)], 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]]
Product exploration explored 100000 steps with 19657 reset in 340 ms.
Product exploration explored 100000 steps with 19611 reset in 336 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/63 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2022-05-15 03:26:08] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:26:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 03:26:08] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-15 03:26:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 03:26:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 03:26:08] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-15 03:26:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 110 ms returned sat
[2022-05-15 03:26:08] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2022-05-15 03:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-15 03:26:09] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 25 ms.
[2022-05-15 03:26:09] [INFO ] Added : 18 causal constraints over 5 iterations in 156 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:26:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:09] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
[2022-05-15 03:26:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-15 03:26:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:09] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2022-05-15 03:26:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:09] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/63 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2022-05-15 03:26:10] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 03:26:10] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-05-15 03:26:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 03:26:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 03:26:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 03:26:10] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-15 03:26:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 110 ms returned sat
[2022-05-15 03:26:11] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2022-05-15 03:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2022-05-15 03:26:11] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 26 ms.
[2022-05-15 03:26:11] [INFO ] Added : 18 causal constraints over 5 iterations in 159 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19402 reset in 292 ms.
Product exploration explored 100000 steps with 19576 reset in 311 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 65 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:26:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:26:12] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
[2022-05-15 03:26:12] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-15 03:26:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:12] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Product exploration explored 100000 steps with 19450 reset in 473 ms.
Product exploration explored 100000 steps with 19534 reset in 456 ms.
Built C files in :
/tmp/ltsmin13898951247054538196
[2022-05-15 03:26:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13898951247054538196
Running compilation step : cd /tmp/ltsmin13898951247054538196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin13898951247054538196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13898951247054538196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14594584800683688504.hoa' '--buchi-type=spotba'
LTSmin run took 1521 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02 finished in 10041 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(X(G(p1)))||F(p0)))||X(p2)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 548
Applied a total of 1 rules in 8 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:26:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 03:26:16] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 03:26:16] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
[2022-05-15 03:26:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 03:26:16] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 03:26:16] [INFO ] Implicit Places using invariants in 96 ms returned []
[2022-05-15 03:26:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 03:26:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 03:26:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:16] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/68 places, 548/548 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 3 s53), p2:(LEQ 1 s23), p1:(LEQ s47 s53)], 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]]
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 1145 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/66 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2) p1)))
Knowledge based reduction with 7 factoid took 213 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03 finished in 1448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))||G(!p0)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 31 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:26:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:18] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
[2022-05-15 03:26:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:18] [INFO ] Implicit Places using invariants in 87 ms returned []
[2022-05-15 03:26:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:18] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2022-05-15 03:26:18] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-15 03:26:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:18] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/68 places, 547/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) p0), (NOT p1), (NOT p1), p0, true]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LEQ 3 s48) (LEQ s22 s24)), p0:(LEQ 3 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 566 steps with 3 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04 finished in 821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(p1)&&F(p2)&&p0))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 548
Applied a total of 1 rules in 6 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:26:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 03:26:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 03:26:18] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
[2022-05-15 03:26:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 03:26:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 03:26:18] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-15 03:26:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 03:26:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 03:26:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:19] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2022-05-15 03:26:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 03:26:19] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 03:26:19] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/68 places, 548/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GT s24 s25) (GT 3 s49)), p1:(OR (LEQ s22 (ADD s53 s54)) (GT 3 s49)), p2:(GT s22 (ADD s53 s54))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 172 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06 finished in 795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 9 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:26:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:19] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
[2022-05-15 03:26:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:19] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-05-15 03:26:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:19] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 307 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 547/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s25)], 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][false, false]]
Product exploration explored 100000 steps with 1801 reset in 210 ms.
Product exploration explored 100000 steps with 1806 reset in 229 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2022-05-15 03:26:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 03:26:20] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-15 03:26:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 03:26:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 03:26:21] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-15 03:26:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:21] [INFO ] [Nat]Added 22 Read/Feed constraints in 155 ms returned sat
[2022-05-15 03:26:21] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 24 ms.
[2022-05-15 03:26:21] [INFO ] Added : 11 causal constraints over 3 iterations in 88 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 61 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 59 transition count 544
Applied a total of 7 rules in 41 ms. Remains 59 /63 variables (removed 4) and now considering 544/547 (removed 3) transitions.
[2022-05-15 03:26:21] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 59 cols
[2022-05-15 03:26:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 03:26:21] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-15 03:26:21] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 59 cols
[2022-05-15 03:26:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:26:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:21] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2022-05-15 03:26:21] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 03:26:21] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 59 cols
[2022-05-15 03:26:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:26:21] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/63 places, 544/547 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 544/547 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
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 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2022-05-15 03:26:22] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 59 cols
[2022-05-15 03:26:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:26:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 03:26:22] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-15 03:26:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 03:26:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 03:26:22] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-15 03:26:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:22] [INFO ] [Nat]Added 22 Read/Feed constraints in 170 ms returned sat
[2022-05-15 03:26:22] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 73 transitions) in 20 ms.
[2022-05-15 03:26:22] [INFO ] Added : 10 causal constraints over 5 iterations in 92 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2207 reset in 213 ms.
Product exploration explored 100000 steps with 2206 reset in 211 ms.
Built C files in :
/tmp/ltsmin10800628866857089676
[2022-05-15 03:26:23] [INFO ] Computing symmetric may disable matrix : 544 transitions.
[2022-05-15 03:26:23] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:23] [INFO ] Computing symmetric may enable matrix : 544 transitions.
[2022-05-15 03:26:23] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:23] [INFO ] Computing Do-Not-Accords matrix : 544 transitions.
[2022-05-15 03:26:23] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:23] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10800628866857089676
Running compilation step : cd /tmp/ltsmin10800628866857089676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1594 ms.
Running link step : cd /tmp/ltsmin10800628866857089676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10800628866857089676;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6851158458771966028.hoa' '--buchi-type=spotba'
LTSmin run took 2889 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09 finished in 8486 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 23 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:26:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:28] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
[2022-05-15 03:26:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:28] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-15 03:26:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:26:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:28] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 327 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/68 places, 547/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11 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:(OR (LEQ s0 s51) (GT s39 s22))], 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 2291 reset in 245 ms.
Product exploration explored 100000 steps with 2402 reset in 248 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/63 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 19 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:26:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:29] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2022-05-15 03:26:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:29] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-15 03:26:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:30] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2022-05-15 03:26:30] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 03:26:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:26:30] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/63 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2246 reset in 238 ms.
Product exploration explored 100000 steps with 2350 reset in 249 ms.
Built C files in :
/tmp/ltsmin4712096095240066234
[2022-05-15 03:26:31] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2022-05-15 03:26:31] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:31] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2022-05-15 03:26:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:31] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2022-05-15 03:26:31] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:31] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4712096095240066234
Running compilation step : cd /tmp/ltsmin4712096095240066234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1551 ms.
Running link step : cd /tmp/ltsmin4712096095240066234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4712096095240066234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15413210715439385245.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 23 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:26:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:26:46] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
[2022-05-15 03:26:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:26:46] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-05-15 03:26:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:26:46] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2022-05-15 03:26:46] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 03:26:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:26:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:26:47] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin5402588729942596777
[2022-05-15 03:26:47] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2022-05-15 03:26:47] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:47] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2022-05-15 03:26:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:47] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2022-05-15 03:26:47] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:26:47] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5402588729942596777
Running compilation step : cd /tmp/ltsmin5402588729942596777;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1553 ms.
Running link step : cd /tmp/ltsmin5402588729942596777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5402588729942596777;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14862123731588234858.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 03:27:02] [INFO ] Flatten gal took : 29 ms
[2022-05-15 03:27:02] [INFO ] Flatten gal took : 31 ms
[2022-05-15 03:27:02] [INFO ] Time to serialize gal into /tmp/LTL2242930911089455560.gal : 4 ms
[2022-05-15 03:27:02] [INFO ] Time to serialize properties into /tmp/LTL404526420617103067.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2242930911089455560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL404526420617103067.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2242930...265
Read 1 LTL properties
Checking formula 0 : !((G(F("((ROUTE_A<=ROUTE_B)||(NB_ATTENTE_B_13>SUR_PONT_A))"))))
Formula 0 simplified : !GF"((ROUTE_A<=ROUTE_B)||(NB_ATTENTE_B_13>SUR_PONT_A))"
Detected timeout of ITS tools.
[2022-05-15 03:27:17] [INFO ] Flatten gal took : 29 ms
[2022-05-15 03:27:17] [INFO ] Applying decomposition
[2022-05-15 03:27:17] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13022641294202373289.txt' '-o' '/tmp/graph13022641294202373289.bin' '-w' '/tmp/graph13022641294202373289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13022641294202373289.bin' '-l' '-1' '-v' '-w' '/tmp/graph13022641294202373289.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:27:17] [INFO ] Decomposing Gal with order
[2022-05-15 03:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:27:17] [INFO ] Removed a total of 526 redundant transitions.
[2022-05-15 03:27:17] [INFO ] Flatten gal took : 179 ms
[2022-05-15 03:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 189 labels/synchronizations in 8 ms.
[2022-05-15 03:27:17] [INFO ] Time to serialize gal into /tmp/LTL11865383928830857129.gal : 5 ms
[2022-05-15 03:27:17] [INFO ] Time to serialize properties into /tmp/LTL943308904592255447.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11865383928830857129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL943308904592255447.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1186538...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu3.ROUTE_A<=gu3.ROUTE_B)||(gu1.NB_ATTENTE_B_13>gu1.SUR_PONT_A))"))))
Formula 0 simplified : !GF"((gu3.ROUTE_A<=gu3.ROUTE_B)||(gu1.NB_ATTENTE_B_13>gu1.SUR_PONT_A))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15974912205594527661
[2022-05-15 03:27:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15974912205594527661
Running compilation step : cd /tmp/ltsmin15974912205594527661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 893 ms.
Running link step : cd /tmp/ltsmin15974912205594527661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15974912205594527661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11 finished in 79842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))||!(p1 U p2)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:27:47] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:27:47] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:27:47] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
[2022-05-15 03:27:47] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:27:47] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:27:48] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-15 03:27:48] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:27:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:27:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:27:48] [INFO ] Implicit Places using invariants and state equation in 264 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 359 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(GT s49 s51), p0:(GT 3 s49), p1:(LEQ 1 s23)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 585 reset in 264 ms.
Product exploration explored 100000 steps with 585 reset in 267 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (AND p0 p1 (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND 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 11 factoid took 477 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 03:27:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:27:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:27:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:27:49] [INFO ] After 26ms 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 p2) p0 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (AND p0 p1 (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F p2), (F (AND p2 p0)), (F (NOT (AND (NOT p2) p1 p0)))]
Knowledge based reduction with 12 factoid took 570 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 23 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:27:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:27:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:27:50] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2022-05-15 03:27:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:27:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:27:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-15 03:27:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:27:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:27:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:27:50] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2022-05-15 03:27:50] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 03:27:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:27:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:27:51] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) p2))), (X (OR (AND p0 p2) (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND p0 p2) (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 98 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) p2))), (X (OR (AND p0 p2) (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND p0 p2) (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p0))), (F (NOT (OR (AND (NOT p2) p1) (AND p2 p0))))]
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 585 reset in 248 ms.
Product exploration explored 100000 steps with 585 reset in 262 ms.
Built C files in :
/tmp/ltsmin2638456736775973069
[2022-05-15 03:27:52] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 03:27:52] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:27:52] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 03:27:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:27:52] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 03:27:52] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:27:52] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2638456736775973069
Running compilation step : cd /tmp/ltsmin2638456736775973069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1560 ms.
Running link step : cd /tmp/ltsmin2638456736775973069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2638456736775973069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11323105760525838707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 27 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:28:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:28:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:07] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2022-05-15 03:28:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:28:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-15 03:28:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:28:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:28:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:07] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2022-05-15 03:28:07] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-15 03:28:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:28:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:08] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Built C files in :
/tmp/ltsmin16494192066299911733
[2022-05-15 03:28:08] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 03:28:08] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:08] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 03:28:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:08] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 03:28:08] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:08] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16494192066299911733
Running compilation step : cd /tmp/ltsmin16494192066299911733;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1547 ms.
Running link step : cd /tmp/ltsmin16494192066299911733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16494192066299911733;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15316162705817454783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 03:28:23] [INFO ] Flatten gal took : 24 ms
[2022-05-15 03:28:23] [INFO ] Flatten gal took : 23 ms
[2022-05-15 03:28:23] [INFO ] Time to serialize gal into /tmp/LTL17963877117781944899.gal : 5 ms
[2022-05-15 03:28:23] [INFO ] Time to serialize properties into /tmp/LTL6744956181627398131.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17963877117781944899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6744956181627398131.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1796387...267
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G("(SUR_PONT_B<3)")))||(!(("(CAPACITE>=1)")U("(SUR_PONT_B>VIDANGE_2)")))))))
Formula 0 simplified : !GF(FG"(SUR_PONT_B<3)" | !("(CAPACITE>=1)" U "(SUR_PONT_B>VIDANGE_2)"))
Detected timeout of ITS tools.
[2022-05-15 03:28:38] [INFO ] Flatten gal took : 24 ms
[2022-05-15 03:28:38] [INFO ] Applying decomposition
[2022-05-15 03:28:38] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5857462153038146605.txt' '-o' '/tmp/graph5857462153038146605.bin' '-w' '/tmp/graph5857462153038146605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5857462153038146605.bin' '-l' '-1' '-v' '-w' '/tmp/graph5857462153038146605.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:28:38] [INFO ] Decomposing Gal with order
[2022-05-15 03:28:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:28:38] [INFO ] Removed a total of 694 redundant transitions.
[2022-05-15 03:28:38] [INFO ] Flatten gal took : 151 ms
[2022-05-15 03:28:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 539 labels/synchronizations in 12 ms.
[2022-05-15 03:28:38] [INFO ] Time to serialize gal into /tmp/LTL613221596137341870.gal : 3 ms
[2022-05-15 03:28:38] [INFO ] Time to serialize properties into /tmp/LTL1448120991666883774.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL613221596137341870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1448120991666883774.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6132215...265
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G("(gu1.SUR_PONT_B<3)")))||(!(("(gi0.gu0.CAPACITE>=1)")U("(gu1.SUR_PONT_B>gu1.VIDANGE_2)")))))))
Formula 0 simplified : !GF(FG"(gu1.SUR_PONT_B<3)" | !("(gi0.gu0.CAPACITE>=1)" U "(gu1.SUR_PONT_B>gu1.VIDANGE_2)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7793737055435077947
[2022-05-15 03:28:53] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7793737055435077947
Running compilation step : cd /tmp/ltsmin7793737055435077947;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 921 ms.
Running link step : cd /tmp/ltsmin7793737055435077947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7793737055435077947;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((<>([]((LTLAPp0==true)))||!((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 finished in 81034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&F(p1)))||G(!p1)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 22 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:29:08] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:29:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:29:08] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2022-05-15 03:29:08] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:29:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:09] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-15 03:29:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:29:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:29:09] [INFO ] Implicit Places using invariants and state equation in 253 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 356 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/68 places, 547/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND p1 (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s48 s51), p0:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 665 reset in 248 ms.
Product exploration explored 100000 steps with 664 reset in 259 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/63 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 492 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 13 factoid took 497 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:29:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:11] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:29:11] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
[2022-05-15 03:29:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:11] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-15 03:29:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:29:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:29:11] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2022-05-15 03:29:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:12] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/63 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 210 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 77 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 363 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 665 reset in 250 ms.
Product exploration explored 100000 steps with 665 reset in 256 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:29:14] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:14] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
[2022-05-15 03:29:14] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-15 03:29:14] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:14] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Product exploration explored 100000 steps with 664 reset in 242 ms.
Product exploration explored 100000 steps with 665 reset in 258 ms.
Built C files in :
/tmp/ltsmin10497542211219482863
[2022-05-15 03:29:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10497542211219482863
Running compilation step : cd /tmp/ltsmin10497542211219482863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 924 ms.
Running link step : cd /tmp/ltsmin10497542211219482863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10497542211219482863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5691015272154902541.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:29:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:29:30] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
[2022-05-15 03:29:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2022-05-15 03:29:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:29:30] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2022-05-15 03:29:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:29:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:29:30] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin8384164018120538806
[2022-05-15 03:29:30] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8384164018120538806
Running compilation step : cd /tmp/ltsmin8384164018120538806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 898 ms.
Running link step : cd /tmp/ltsmin8384164018120538806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8384164018120538806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18055682258153706590.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 03:29:45] [INFO ] Flatten gal took : 20 ms
[2022-05-15 03:29:45] [INFO ] Flatten gal took : 19 ms
[2022-05-15 03:29:45] [INFO ] Time to serialize gal into /tmp/LTL18136862094932734032.gal : 3 ms
[2022-05-15 03:29:45] [INFO ] Time to serialize properties into /tmp/LTL12154631017108107906.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18136862094932734032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12154631017108107906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1813686...268
Read 1 LTL properties
Checking formula 0 : !(((F((G("(NB_ATTENTE_A_4<1)"))&&(F("(SUR_PONT_B<=ROUTE_B)"))))||(G("(SUR_PONT_B>ROUTE_B)"))))
Formula 0 simplified : !(F(G"(NB_ATTENTE_A_4<1)" & F"(SUR_PONT_B<=ROUTE_B)") | G"(SUR_PONT_B>ROUTE_B)")
Detected timeout of ITS tools.
[2022-05-15 03:30:00] [INFO ] Flatten gal took : 19 ms
[2022-05-15 03:30:00] [INFO ] Applying decomposition
[2022-05-15 03:30:00] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2774420646529436862.txt' '-o' '/tmp/graph2774420646529436862.bin' '-w' '/tmp/graph2774420646529436862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2774420646529436862.bin' '-l' '-1' '-v' '-w' '/tmp/graph2774420646529436862.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:30:00] [INFO ] Decomposing Gal with order
[2022-05-15 03:30:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:30:00] [INFO ] Removed a total of 494 redundant transitions.
[2022-05-15 03:30:00] [INFO ] Flatten gal took : 65 ms
[2022-05-15 03:30:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 4 ms.
[2022-05-15 03:30:01] [INFO ] Time to serialize gal into /tmp/LTL8754961704963603619.gal : 3 ms
[2022-05-15 03:30:01] [INFO ] Time to serialize properties into /tmp/LTL11509227196682939622.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8754961704963603619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11509227196682939622.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8754961...267
Read 1 LTL properties
Checking formula 0 : !(((F((G("(gi1.gu2.NB_ATTENTE_A_4<1)"))&&(F("(gu1.SUR_PONT_B<=gu1.ROUTE_B)"))))||(G("(gu1.SUR_PONT_B>gu1.ROUTE_B)"))))
Formula 0 simplified : !(F(G"(gi1.gu2.NB_ATTENTE_A_4<1)" & F"(gu1.SUR_PONT_B<=gu1.ROUTE_B)") | G"(gu1.SUR_PONT_B>gu1.ROUTE_B)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1985193548960533197
[2022-05-15 03:30:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1985193548960533197
Running compilation step : cd /tmp/ltsmin1985193548960533197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 912 ms.
Running link step : cd /tmp/ltsmin1985193548960533197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1985193548960533197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(([]((LTLAPp0==true))&&<>((LTLAPp1==true))))||[](!(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 finished in 82364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:30:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:31] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
[2022-05-15 03:30:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:30:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:31] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-15 03:30:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:30:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:31] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 367 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s49 s52), p0:(LEQ s33 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1249 reset in 235 ms.
Product exploration explored 100000 steps with 1231 reset in 236 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 323 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:30:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:32] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:32] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:33] [INFO ] After 33ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:33] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-15 03:30:33] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:33] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:33] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10001 steps, including 56 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 678168 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 678168 steps, saw 165749 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:30:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:36] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:30:36] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:36] [INFO ] After 22ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:36] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 03:30:36] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:36] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-15 03:30:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:37] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2022-05-15 03:30:37] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-15 03:30:37] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:37] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 61 cols
[2022-05-15 03:30:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:37] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:37] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 03:30:37] [INFO ] After 47ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:37] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-15 03:30:37] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:37] [INFO ] Flatten gal took : 8 ms
[2022-05-15 03:30:37] [INFO ] Flatten gal took : 6 ms
[2022-05-15 03:30:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6901609859735755362.gal : 2 ms
[2022-05-15 03:30:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15128961188077170568.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17244619443830208352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6901609859735755362.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15128961188077170568.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality15128961188077170568.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 113
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :113 after 840
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :840 after 12012
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :12012 after 148680
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :148680 after 222978
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.18889e+06 after 1.41128e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.29609e+06 after 8.80765e+06
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.89592e+07,0.307996,14076,2,6155,19,60460,6,0,375,36424,0
Total reachable state count : 58959180
Verifying 2 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4578,0.312527,14076,2,464,19,60460,7,0,396,36424,0
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,4578,0.31309,14076,2,464,19,60460,7,0,396,36424,0
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 341 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 22 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:38] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:38] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
[2022-05-15 03:30:38] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:38] [INFO ] Implicit Places using invariants in 96 ms returned []
[2022-05-15 03:30:38] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:38] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:38] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2022-05-15 03:30:38] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-15 03:30:38] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:38] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 310 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:30:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:39] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:39] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:39] [INFO ] After 23ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:39] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-15 03:30:39] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:39] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10007 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 649038 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649038 steps, saw 159100 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:30:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:43] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:43] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:43] [INFO ] After 30ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:43] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-15 03:30:43] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:43] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-05-15 03:30:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:43] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2022-05-15 03:30:43] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-15 03:30:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:43] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 4 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 61 cols
[2022-05-15 03:30:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:43] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:43] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 03:30:43] [INFO ] After 44ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:44] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-15 03:30:44] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:44] [INFO ] Flatten gal took : 10 ms
[2022-05-15 03:30:44] [INFO ] Flatten gal took : 6 ms
[2022-05-15 03:30:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15866040018445500300.gal : 1 ms
[2022-05-15 03:30:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11744074637573417459.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15795049549622070011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15866040018445500300.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11744074637573417459.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11744074637573417459.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 113
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :113 after 840
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :840 after 12012
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :12012 after 148680
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :148680 after 222978
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.18889e+06 after 1.41128e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.29609e+06 after 8.80765e+06
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.89592e+07,0.32461,14080,2,6155,19,60629,6,0,375,36440,0
Total reachable state count : 58959180
Verifying 2 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4578,0.327932,14080,2,464,19,60629,7,0,396,36440,0
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,4578,0.328446,14344,2,464,19,60629,7,0,396,36440,0
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 308 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1241 reset in 230 ms.
Product exploration explored 100000 steps with 1243 reset in 236 ms.
Built C files in :
/tmp/ltsmin10433391241361627132
[2022-05-15 03:30:45] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 03:30:45] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:45] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 03:30:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:45] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 03:30:45] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:45] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10433391241361627132
Running compilation step : cd /tmp/ltsmin10433391241361627132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1551 ms.
Running link step : cd /tmp/ltsmin10433391241361627132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10433391241361627132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11941572311566164837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:31:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:31:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:31:00] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
[2022-05-15 03:31:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:31:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:31:00] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-15 03:31:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:31:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:31:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:31:01] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2022-05-15 03:31:01] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-15 03:31:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:31:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:31:01] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Built C files in :
/tmp/ltsmin6915547023685071986
[2022-05-15 03:31:01] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 03:31:01] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:31:01] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 03:31:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:31:01] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 03:31:01] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:31:01] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6915547023685071986
Running compilation step : cd /tmp/ltsmin6915547023685071986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1555 ms.
Running link step : cd /tmp/ltsmin6915547023685071986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6915547023685071986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15711421397227427002.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 03:31:16] [INFO ] Flatten gal took : 18 ms
[2022-05-15 03:31:16] [INFO ] Flatten gal took : 17 ms
[2022-05-15 03:31:16] [INFO ] Time to serialize gal into /tmp/LTL14242570722275115051.gal : 4 ms
[2022-05-15 03:31:16] [INFO ] Time to serialize properties into /tmp/LTL7906763485233496138.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14242570722275115051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7906763485233496138.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1424257...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("(NB_ATTENTE_B_7<=CAPACITE)")U("(SUR_PONT_B<=ROUTE_B)")))))
Formula 0 simplified : !FG("(NB_ATTENTE_B_7<=CAPACITE)" U "(SUR_PONT_B<=ROUTE_B)")
Detected timeout of ITS tools.
[2022-05-15 03:31:31] [INFO ] Flatten gal took : 19 ms
[2022-05-15 03:31:31] [INFO ] Applying decomposition
[2022-05-15 03:31:31] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11761882552396625517.txt' '-o' '/tmp/graph11761882552396625517.bin' '-w' '/tmp/graph11761882552396625517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11761882552396625517.bin' '-l' '-1' '-v' '-w' '/tmp/graph11761882552396625517.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:31:31] [INFO ] Decomposing Gal with order
[2022-05-15 03:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:31:31] [INFO ] Removed a total of 543 redundant transitions.
[2022-05-15 03:31:31] [INFO ] Flatten gal took : 61 ms
[2022-05-15 03:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 4 ms.
[2022-05-15 03:31:31] [INFO ] Time to serialize gal into /tmp/LTL13153622724223594911.gal : 2 ms
[2022-05-15 03:31:31] [INFO ] Time to serialize properties into /tmp/LTL5707930763368067392.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13153622724223594911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5707930763368067392.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1315362...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu0.NB_ATTENTE_B_7<=gu0.CAPACITE)")U("(gu1.SUR_PONT_B<=gu1.ROUTE_B)")))))
Formula 0 simplified : !FG("(gu0.NB_ATTENTE_B_7<=gu0.CAPACITE)" U "(gu1.SUR_PONT_B<=gu1.ROUTE_B)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2662625627862732542
[2022-05-15 03:31:46] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2662625627862732542
Running compilation step : cd /tmp/ltsmin2662625627862732542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 900 ms.
Running link step : cd /tmp/ltsmin2662625627862732542;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2662625627862732542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15 finished in 90676 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))||!(p1 U p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&F(p1)))||G(!p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
[2022-05-15 03:32:02] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2583353740035934089
[2022-05-15 03:32:02] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 03:32:02] [INFO ] Applying decomposition
[2022-05-15 03:32:02] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:32:02] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 03:32:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:32:02] [INFO ] Flatten gal took : 17 ms
[2022-05-15 03:32:02] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 03:32:02] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1811268458960482837.txt' '-o' '/tmp/graph1811268458960482837.bin' '-w' '/tmp/graph1811268458960482837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1811268458960482837.bin' '-l' '-1' '-v' '-w' '/tmp/graph1811268458960482837.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:32:02] [INFO ] Decomposing Gal with order
[2022-05-15 03:32:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:32:02] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2583353740035934089
Running compilation step : cd /tmp/ltsmin2583353740035934089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 03:32:02] [INFO ] Removed a total of 798 redundant transitions.
[2022-05-15 03:32:02] [INFO ] Flatten gal took : 209 ms
[2022-05-15 03:32:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 587 labels/synchronizations in 10 ms.
[2022-05-15 03:32:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality2714164766290224643.gal : 5 ms
[2022-05-15 03:32:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality13173226821037062941.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2714164766290224643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13173226821037062941.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 4 LTL properties
Checking formula 0 : !((G(F("((gu2.ROUTE_A<=gu2.ROUTE_B)||(gu1.NB_ATTENTE_B_13>gu1.SUR_PONT_A))"))))
Formula 0 simplified : !GF"((gu2.ROUTE_A<=gu2.ROUTE_B)||(gu1.NB_ATTENTE_B_13>gu1.SUR_PONT_A))"
Compilation finished in 1557 ms.
Running link step : cd /tmp/ltsmin2583353740035934089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2583353740035934089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi3.t349, gi3.t87, t0, t21, t42, t43, t44, t45, t157, t168, t223, Intersection with reachabl...226
Computing Next relation with stutter on 20 deadlock states
LTSmin run took 512664 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2583353740035934089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((<>([]((LTLAPp1==true)))||!((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 03:54:04] [INFO ] Flatten gal took : 68 ms
[2022-05-15 03:54:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality17534221335715159033.gal : 15 ms
[2022-05-15 03:54:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality826138565372844702.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17534221335715159033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality826138565372844702.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 3 LTL properties
Checking formula 0 : !((G(F((F(G("(SUR_PONT_B<3)")))||(!(("(CAPACITE>=1)")U("(SUR_PONT_B>VIDANGE_2)")))))))
Formula 0 simplified : !GF(FG"(SUR_PONT_B<3)" | !("(CAPACITE>=1)" U "(SUR_PONT_B>VIDANGE_2)"))
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2583353740035934089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((<>([]((LTLAPp1==true)))||!((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2583353740035934089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>(([]((LTLAPp4==true))&&<>((LTLAPp5==true))))||[](!(LTLAPp5==true)))' '--buchi-type=spotba'
LTSmin run took 467679 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2583353740035934089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp6==true) U (LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 04:16:07] [INFO ] Flatten gal took : 72 ms
[2022-05-15 04:16:07] [INFO ] Input system was already deterministic with 548 transitions.
[2022-05-15 04:16:07] [INFO ] Transformed 68 places.
[2022-05-15 04:16:07] [INFO ] Transformed 548 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 04:16:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality1843419925956122497.gal : 16 ms
[2022-05-15 04:16:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality8651633062732318694.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1843419925956122497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8651633062732318694.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((F(G("(SUR_PONT_B<3)")))||(!(("(CAPACITE>=1)")U("(SUR_PONT_B>VIDANGE_2)")))))))
Formula 0 simplified : !GF(FG"(SUR_PONT_B<3)" | !("(CAPACITE>=1)" U "(SUR_PONT_B>VIDANGE_2)"))
LTSmin run took 797144 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin2583353740035934089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((<>([]((LTLAPp1==true)))||!((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-V20P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918200203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;