About the Execution of ITS-Tools for BridgeAndVehicles-COL-V50P50N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14325.544 | 3600000.00 | 13555840.00 | 1621.50 | TFFTFFF??FF?TFFF | 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-165251918100099.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-COL-V50P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918100099
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 23:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 23:46 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 3.7K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652557342710
Running Version 202205111006
[2022-05-14 19:42:23] [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-14 19:42:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 19:42:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-14 19:42:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 19:42:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2022-05-14 19:42:24] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 19:42:24] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 9 ms.
[2022-05-14 19:42:24] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 19:42:25] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 19:42:25] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-14 19:42:25] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 19:42:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-14 19:42:25] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:25] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-14 19:42:25] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 314 steps, including 1 resets, run visited all 5 properties in 7 ms. (steps per millisecond=44 )
Parikh walk visited 5 properties in 8 ms.
[2022-05-14 19:42:25] [INFO ] Flatten gal took : 14 ms
[2022-05-14 19:42:25] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-14 19:42:25] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 95 ms.
[2022-05-14 19:42:25] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 58 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:42:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-14 19:42:26] [INFO ] Computed 7 place invariants in 21 ms
[2022-05-14 19:42:26] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
[2022-05-14 19:42:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-14 19:42:26] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-14 19:42:27] [INFO ] Implicit Places using invariants in 381 ms returned []
[2022-05-14 19:42:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-14 19:42:27] [INFO ] Computed 7 place invariants in 9 ms
[2022-05-14 19:42:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:27] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2022-05-14 19:42:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-14 19:42:27] [INFO ] Computed 7 place invariants in 7 ms
[2022-05-14 19:42:28] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 2348/2348 transitions.
Support contains 13 out of 138 places after structural reductions.
[2022-05-14 19:42:28] [INFO ] Flatten gal took : 165 ms
[2022-05-14 19:42:29] [INFO ] Flatten gal took : 145 ms
[2022-05-14 19:42:29] [INFO ] Input system was already deterministic with 2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-14 19:42:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-14 19:42:30] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-14 19:42:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 19:42:30] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 19:42:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 19:42:30] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:31] [INFO ] After 322ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:31] [INFO ] After 877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 257 ms.
[2022-05-14 19:42:31] [INFO ] After 1484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 388 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:42:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:42:33] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/138 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 212672 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212672 steps, saw 56863 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-14 19:42:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:36] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 19:42:36] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:42:37] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 19:42:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:42:37] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:37] [INFO ] After 229ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:37] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 457 ms.
[2022-05-14 19:42:38] [INFO ] After 1299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 71 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 227 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 345 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:42:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:42:39] [INFO ] Implicit Places using invariants in 406 ms returned []
[2022-05-14 19:42:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:42:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:40] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1564 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 184 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/135 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10017 steps, including 8 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 241533 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241533 steps, saw 64426 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-14 19:42:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:42:44] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 19:42:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:42:44] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 19:42:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:42:44] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:45] [INFO ] After 292ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:45] [INFO ] After 881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 438 ms.
[2022-05-14 19:42:46] [INFO ] After 1586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 71 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 211 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 180 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:42:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:42:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:42:46] [INFO ] Implicit Places using invariants in 346 ms returned []
[2022-05-14 19:42:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:42:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:42:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:47] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2022-05-14 19:42:47] [INFO ] Redundant transitions in 134 ms returned []
[2022-05-14 19:42:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:42:47] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:42:48] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2060 place count 133 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2062 place count 131 transition count 287
Applied a total of 2062 rules in 19 ms. Remains 131 /133 variables (removed 2) and now considering 287/2347 (removed 2060) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 287 rows 131 cols
[2022-05-14 19:42:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:42:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:42:48] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-14 19:42:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:42:49] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 19:42:49] [INFO ] After 118ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:49] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 158 ms.
[2022-05-14 19:42:49] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-14 19:42:49] [INFO ] Flatten gal took : 30 ms
[2022-05-14 19:42:49] [INFO ] Flatten gal took : 15 ms
[2022-05-14 19:42:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11499833707375889250.gal : 27 ms
[2022-05-14 19:42:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5515473240700373760.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12723375269250037326;'/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/ReachabilityCardinality11499833707375889250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5515473240700373760.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/ReachabilityCardinality5515473240700373760.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :15 after 23
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :23 after 41
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :41 after 77
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :77 after 124
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :124 after 2480
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2480 after 27280
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :27280 after 250976
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :250976 after 2.10924e+06
Reachability property AtomicPropp15 is true.
Reachability property AtomicPropp10 is true.
Reachability property AtomicPropp7 is true.
Reachability property AtomicPropp2 is true.
Reachability property AtomicPropp0 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,7.87189e+06,0.817928,29104,2,9733,17,109341,6,0,818,47259,0
Total reachable state count : 7871892
Verifying 5 reachability properties.
Reachability property AtomicPropp0 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
AtomicPropp0,372,0.819096,29104,2,469,17,109341,7,0,821,47259,0
Reachability property AtomicPropp2 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
AtomicPropp2,4,0.819731,29104,2,135,17,109341,8,0,824,47259,0
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,372,0.820062,29104,2,469,17,109341,9,0,825,47259,0
Reachability property AtomicPropp10 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
AtomicPropp10,372,0.820484,29104,2,469,17,109341,10,0,826,47259,0
Reachability property AtomicPropp15 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
AtomicPropp15,372,0.820753,29104,2,469,17,109341,11,0,827,47259,0
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&(G(p1)||G(!p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 22 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:42:50] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:42:51] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
[2022-05-14 19:42:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:51] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:42:51] [INFO ] Implicit Places using invariants in 340 ms returned []
[2022-05-14 19:42:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:51] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 19:42:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:52] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1542 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT 2 s105), p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01 finished in 2629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(F(p1))))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 546 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:42:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:42:54] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
[2022-05-14 19:42:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:42:54] [INFO ] Implicit Places using invariants in 334 ms returned []
[2022-05-14 19:42:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:42:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:42:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:55] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1475 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 262 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s0 (ADD s131 s132))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 412 steps with 0 reset in 31 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02 finished in 3046 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(X(X(p0))) U p1)&&X(p0)))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 18 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:42:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:42:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:42:56] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
[2022-05-14 19:42:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:42:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:42:57] [INFO ] Implicit Places using invariants in 319 ms returned []
[2022-05-14 19:42:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:42:57] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:42:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:42:58] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2022-05-14 19:42:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:42:58] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:42:58] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s54 s107), p0:(LEQ s53 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 923 ms.
Product exploration explored 100000 steps with 33333 reset in 919 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03 finished in 4581 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 21 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:43:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:43:00] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:43:01] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
[2022-05-14 19:43:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:43:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:01] [INFO ] Implicit Places using invariants in 318 ms returned []
[2022-05-14 19:43:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:43:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:43:02] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1423 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ s52 s0), p1:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2492 steps with 6 reset in 19 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 finished in 2271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(F(G(p0)))))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 335 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:43:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:43:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:04] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
[2022-05-14 19:43:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:43:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:04] [INFO ] Implicit Places using invariants in 317 ms returned []
[2022-05-14 19:43:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:43:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:43:05] [INFO ] Implicit Places using invariants and state equation in 966 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1288 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 197 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s104 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 362 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05 finished in 2550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&X(p1)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 13 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:43:05] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:43:05] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 19:43:06] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
[2022-05-14 19:43:06] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:43:06] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 19:43:06] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-05-14 19:43:06] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:43:06] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:43:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:43:07] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1520 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 17 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 3 s0), p1:(LEQ 1 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06 finished in 2440 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(G((G(p0) U p0))))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 2347
Applied a total of 3 rules in 217 ms. Remains 136 /138 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:43:08] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-14 19:43:08] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:43:09] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
[2022-05-14 19:43:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-14 19:43:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:43:09] [INFO ] Implicit Places using invariants in 339 ms returned []
[2022-05-14 19:43:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-14 19:43:09] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:43:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:43:10] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1692 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 177 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s52 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 274 reset in 787 ms.
Product exploration explored 100000 steps with 274 reset in 771 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 3639 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 131 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2022-05-14 19:43:12] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 19:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:43:13] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-14 19:43:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:43:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:43:14] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-05-14 19:43:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:43:14] [INFO ] [Nat]Added 42 Read/Feed constraints in 402 ms returned sat
[2022-05-14 19:43:15] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2022-05-14 19:43:15] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2022-05-14 19:43:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1672 ms
[2022-05-14 19:43:16] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 109 ms.
[2022-05-14 19:43:17] [INFO ] Added : 97 causal constraints over 20 iterations in 793 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 173 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:43:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:18] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
[2022-05-14 19:43:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:18] [INFO ] Implicit Places using invariants in 300 ms returned []
[2022-05-14 19:43:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:43:19] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2022-05-14 19:43:19] [INFO ] Redundant transitions in 116 ms returned []
[2022-05-14 19:43:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:19] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:43:19] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 3639 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2022-05-14 19:43:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:43:21] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 19:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:43:21] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-05-14 19:43:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:43:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:43:21] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2022-05-14 19:43:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:43:22] [INFO ] [Nat]Added 42 Read/Feed constraints in 384 ms returned sat
[2022-05-14 19:43:22] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-05-14 19:43:22] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 0 ms to minimize.
[2022-05-14 19:43:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1674 ms
[2022-05-14 19:43:24] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 56 ms.
[2022-05-14 19:43:24] [INFO ] Added : 97 causal constraints over 20 iterations in 707 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 274 reset in 776 ms.
Product exploration explored 100000 steps with 274 reset in 774 ms.
Built C files in :
/tmp/ltsmin17710962852564377882
[2022-05-14 19:43:26] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2022-05-14 19:43:26] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17710962852564377882
Running compilation step : cd /tmp/ltsmin17710962852564377882;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17710962852564377882;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17710962852564377882;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 190 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:43:29] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:30] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
[2022-05-14 19:43:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:30] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-05-14 19:43:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:43:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:43:31] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2022-05-14 19:43:31] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-14 19:43:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 19:43:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:43:32] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin4760757965408612335
[2022-05-14 19:43:32] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2022-05-14 19:43:32] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4760757965408612335
Running compilation step : cd /tmp/ltsmin4760757965408612335;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4760757965408612335;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4760757965408612335;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 19:43:35] [INFO ] Flatten gal took : 181 ms
[2022-05-14 19:43:35] [INFO ] Flatten gal took : 165 ms
[2022-05-14 19:43:35] [INFO ] Time to serialize gal into /tmp/LTL15050998988190177428.gal : 41 ms
[2022-05-14 19:43:35] [INFO ] Time to serialize properties into /tmp/LTL12212414517978499235.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/LTL15050998988190177428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12212414517978499235.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/LTL1505099...268
Read 1 LTL properties
Checking formula 0 : !((F((G("(ROUTE_A_0<=SORTI_B_0)"))||(F(G((G("(ROUTE_A_0<=SORTI_B_0)"))U("(ROUTE_A_0<=SORTI_B_0)")))))))
Formula 0 simplified : !F(G"(ROUTE_A_0<=SORTI_B_0)" | FG(G"(ROUTE_A_0<=SORTI_B_0)" U "(ROUTE_A_0<=SORTI_B_0)"))
Detected timeout of ITS tools.
[2022-05-14 19:43:50] [INFO ] Flatten gal took : 80 ms
[2022-05-14 19:43:50] [INFO ] Applying decomposition
[2022-05-14 19:43:50] [INFO ] Flatten gal took : 80 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/graph3765703909974018122.txt' '-o' '/tmp/graph3765703909974018122.bin' '-w' '/tmp/graph3765703909974018122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3765703909974018122.bin' '-l' '-1' '-v' '-w' '/tmp/graph3765703909974018122.weights' '-q' '0' '-e' '0.001'
[2022-05-14 19:43:51] [INFO ] Decomposing Gal with order
[2022-05-14 19:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 19:43:51] [INFO ] Removed a total of 2194 redundant transitions.
[2022-05-14 19:43:51] [INFO ] Flatten gal took : 559 ms
[2022-05-14 19:43:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 287 labels/synchronizations in 18 ms.
[2022-05-14 19:43:52] [INFO ] Time to serialize gal into /tmp/LTL15917100065434601252.gal : 10 ms
[2022-05-14 19:43:52] [INFO ] Time to serialize properties into /tmp/LTL8505621100171892672.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/LTL15917100065434601252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8505621100171892672.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/LTL1591710...267
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu0.ROUTE_A_0<=gu0.SORTI_B_0)"))||(F(G((G("(gu0.ROUTE_A_0<=gu0.SORTI_B_0)"))U("(gu0.ROUTE_A_0<=gu0.SORTI_B_0)")))))))
Formula 0 simplified : !F(G"(gu0.ROUTE_A_0<=gu0.SORTI_B_0)" | FG(G"(gu0.ROUTE_A_0<=gu0.SORTI_B_0)" U "(gu0.ROUTE_A_0<=gu0.SORTI_B_0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18362486842583541454
[2022-05-14 19:44:07] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18362486842583541454
Running compilation step : cd /tmp/ltsmin18362486842583541454;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18362486842583541454;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18362486842583541454;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07 finished in 61976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 203 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:44:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:44:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:11] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
[2022-05-14 19:44:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:44:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:11] [INFO ] Implicit Places using invariants in 309 ms returned []
[2022-05-14 19:44:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:44:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:12] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1434 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 205 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 241 reset in 710 ms.
Product exploration explored 100000 steps with 241 reset in 715 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 284681 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284681 steps, saw 76147 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 19:44:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:44:17] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 19:44:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:44:17] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:17] [INFO ] After 83ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:17] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-14 19:44:17] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 181 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:44:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:18] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 284864 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284864 steps, saw 76192 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 19:44:21] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:44:21] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 19:44:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:44:22] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:22] [INFO ] After 83ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:22] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-14 19:44:22] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 183 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 167 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:44:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:22] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:22] [INFO ] Implicit Places using invariants in 329 ms returned []
[2022-05-14 19:44:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:23] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2022-05-14 19:44:23] [INFO ] Redundant transitions in 61 ms returned []
[2022-05-14 19:44:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:23] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:44:24] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 13 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2022-05-14 19:44:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:44:24] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 19:44:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:44:24] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 19:44:24] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:24] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-14 19:44:24] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:24] [INFO ] Flatten gal took : 11 ms
[2022-05-14 19:44:24] [INFO ] Flatten gal took : 11 ms
[2022-05-14 19:44:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6229617763688730070.gal : 1 ms
[2022-05-14 19:44:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5932130635876846385.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3239585608254179368;'/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/ReachabilityCardinality6229617763688730070.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5932130635876846385.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/ReachabilityCardinality5932130635876846385.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 820
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :820 after 4592
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4592 after 29848
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :29848 after 188600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :188600 after 1.23492e+06
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.00503e+06,0.496205,20856,2,9436,16,86391,6,0,808,30684,0
Total reachable state count : 5005034
Verifying 1 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,82,0.497154,20856,2,175,16,86391,7,0,811,30684,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 191 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:44:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:26] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
[2022-05-14 19:44:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:26] [INFO ] Implicit Places using invariants in 336 ms returned []
[2022-05-14 19:44:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:27] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
[2022-05-14 19:44:27] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-14 19:44:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:27] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:44:28] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 282042 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 282042 steps, saw 75440 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 19:44:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:31] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:44:32] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 19:44:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:44:32] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:32] [INFO ] After 89ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:32] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-14 19:44:32] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 173 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:44:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:33] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 286856 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286856 steps, saw 76714 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-14 19:44:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:36] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:44:36] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:44:36] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 19:44:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:44:36] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:36] [INFO ] After 85ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:36] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-14 19:44:36] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 183 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 170 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:44:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:44:37] [INFO ] Implicit Places using invariants in 342 ms returned []
[2022-05-14 19:44:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:38] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2022-05-14 19:44:38] [INFO ] Redundant transitions in 56 ms returned []
[2022-05-14 19:44:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:38] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:44:38] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 10 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2022-05-14 19:44:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:44:38] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 19:44:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:44:39] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 19:44:39] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:39] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-14 19:44:39] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-14 19:44:39] [INFO ] Flatten gal took : 11 ms
[2022-05-14 19:44:39] [INFO ] Flatten gal took : 10 ms
[2022-05-14 19:44:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8412277559140369944.gal : 2 ms
[2022-05-14 19:44:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12329873740741788730.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16988352546704898645;'/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/ReachabilityCardinality8412277559140369944.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12329873740741788730.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/ReachabilityCardinality12329873740741788730.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 820
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :820 after 4592
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4592 after 29848
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :29848 after 188600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :188600 after 1.23492e+06
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.00503e+06,0.52588,20852,2,9436,16,86391,6,0,808,30684,0
Total reachable state count : 5005034
Verifying 1 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,82,0.526864,20852,2,175,16,86391,7,0,811,30684,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 241 reset in 697 ms.
Product exploration explored 100000 steps with 241 reset in 704 ms.
Built C files in :
/tmp/ltsmin1207074003756846061
[2022-05-14 19:44:41] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2022-05-14 19:44:41] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1207074003756846061
Running compilation step : cd /tmp/ltsmin1207074003756846061;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1207074003756846061;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1207074003756846061;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 209 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:44:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:45] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
[2022-05-14 19:44:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:45] [INFO ] Implicit Places using invariants in 300 ms returned []
[2022-05-14 19:44:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:44:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:44:46] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2022-05-14 19:44:46] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-14 19:44:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:44:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:44:47] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin18028874504966544106
[2022-05-14 19:44:47] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2022-05-14 19:44:47] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18028874504966544106
Running compilation step : cd /tmp/ltsmin18028874504966544106;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18028874504966544106;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18028874504966544106;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 19:44:50] [INFO ] Flatten gal took : 75 ms
[2022-05-14 19:44:50] [INFO ] Flatten gal took : 72 ms
[2022-05-14 19:44:50] [INFO ] Time to serialize gal into /tmp/LTL12171192924447498407.gal : 15 ms
[2022-05-14 19:44:50] [INFO ] Time to serialize properties into /tmp/LTL11412732251253249146.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/LTL12171192924447498407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11412732251253249146.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/LTL1217119...268
Read 1 LTL properties
Checking formula 0 : !((F(G("(CAPACITE_0>1)"))))
Formula 0 simplified : !FG"(CAPACITE_0>1)"
Detected timeout of ITS tools.
[2022-05-14 19:45:05] [INFO ] Flatten gal took : 72 ms
[2022-05-14 19:45:05] [INFO ] Applying decomposition
[2022-05-14 19:45:05] [INFO ] Flatten gal took : 75 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/graph11622508733153250207.txt' '-o' '/tmp/graph11622508733153250207.bin' '-w' '/tmp/graph11622508733153250207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11622508733153250207.bin' '-l' '-1' '-v' '-w' '/tmp/graph11622508733153250207.weights' '-q' '0' '-e' '0.001'
[2022-05-14 19:45:05] [INFO ] Decomposing Gal with order
[2022-05-14 19:45:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 19:45:06] [INFO ] Removed a total of 4373 redundant transitions.
[2022-05-14 19:45:06] [INFO ] Flatten gal took : 679 ms
[2022-05-14 19:45:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 24 ms.
[2022-05-14 19:45:06] [INFO ] Time to serialize gal into /tmp/LTL10360198278203659027.gal : 2 ms
[2022-05-14 19:45:06] [INFO ] Time to serialize properties into /tmp/LTL14130822864689993442.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/LTL10360198278203659027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14130822864689993442.ltl' '-c' '-stutter-deadlock'
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/LTL1036019...247
Read 1 LTL properties
Checking formula 0 : !((F(G("(u1.CAPACITE_0>1)"))))
Formula 0 simplified : !FG"(u1.CAPACITE_0>1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11044396227871783740
[2022-05-14 19:45:21] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11044396227871783740
Running compilation step : cd /tmp/ltsmin11044396227871783740;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11044396227871783740;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11044396227871783740;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08 finished in 74609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)&&p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 15 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:45:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:45:25] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
[2022-05-14 19:45:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:45:25] [INFO ] Implicit Places using invariants in 318 ms returned []
[2022-05-14 19:45:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:45:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:45:26] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1351 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 9 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s106), p1:(LEQ 1 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][false, false, false]]
Stuttering criterion allowed to conclude after 774 steps with 13 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10 finished in 2125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p1))||p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 16 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:45:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:45:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:45:27] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
[2022-05-14 19:45:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:45:27] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:45:27] [INFO ] Implicit Places using invariants in 272 ms returned []
[2022-05-14 19:45:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:45:27] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 19:45:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:45:28] [INFO ] Implicit Places using invariants and state equation in 780 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1056 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 1 s54) (LEQ 1 (ADD s109 s110))), p1:(GT s52 (ADD s109 s110))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1844 reset in 635 ms.
Product exploration explored 100000 steps with 1715 reset in 659 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 225 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 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 25 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 264 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 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 16 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:45:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:30] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:45:31] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
[2022-05-14 19:45:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:31] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:45:31] [INFO ] Implicit Places using invariants in 257 ms returned []
[2022-05-14 19:45:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:31] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:45:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:45:33] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2022-05-14 19:45:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:45:33] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 299 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 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 348 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 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1736 reset in 642 ms.
Product exploration explored 100000 steps with 1740 reset in 648 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 2348
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 257 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:45:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:45:37] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
[2022-05-14 19:45:37] [INFO ] Redundant transitions in 49 ms returned []
[2022-05-14 19:45:37] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:37] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:45:38] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/136 places, 2348/2348 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Product exploration explored 100000 steps with 2139 reset in 755 ms.
Product exploration explored 100000 steps with 2027 reset in 741 ms.
Built C files in :
/tmp/ltsmin146719169856839426
[2022-05-14 19:45:39] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin146719169856839426
Running compilation step : cd /tmp/ltsmin146719169856839426;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin146719169856839426;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin146719169856839426;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:45:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 19:45:43] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
[2022-05-14 19:45:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:43] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 19:45:43] [INFO ] Implicit Places using invariants in 261 ms returned []
[2022-05-14 19:45:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:45:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:45:44] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2022-05-14 19:45:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:45:44] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 19:45:45] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin15313525404830242228
[2022-05-14 19:45:45] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15313525404830242228
Running compilation step : cd /tmp/ltsmin15313525404830242228;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15313525404830242228;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15313525404830242228;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 19:45:48] [INFO ] Flatten gal took : 70 ms
[2022-05-14 19:45:48] [INFO ] Flatten gal took : 71 ms
[2022-05-14 19:45:48] [INFO ] Time to serialize gal into /tmp/LTL11370218723008272155.gal : 11 ms
[2022-05-14 19:45:48] [INFO ] Time to serialize properties into /tmp/LTL10861169799491519790.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/LTL11370218723008272155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10861169799491519790.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/LTL1137021...268
Read 1 LTL properties
Checking formula 0 : !((X(G(((G(F("(SORTI_A_0>(CONTROLEUR_0+CONTROLEUR_1))")))||("(ATTENTE_A_0<1)"))||("((CONTROLEUR_0+CONTROLEUR_1)>=1)")))))
Formula 0 simplified : !XG("((CONTROLEUR_0+CONTROLEUR_1)>=1)" | "(ATTENTE_A_0<1)" | GF"(SORTI_A_0>(CONTROLEUR_0+CONTROLEUR_1))")
Detected timeout of ITS tools.
[2022-05-14 19:46:03] [INFO ] Flatten gal took : 93 ms
[2022-05-14 19:46:03] [INFO ] Applying decomposition
[2022-05-14 19:46:04] [INFO ] Flatten gal took : 68 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/graph10573131065585746429.txt' '-o' '/tmp/graph10573131065585746429.bin' '-w' '/tmp/graph10573131065585746429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10573131065585746429.bin' '-l' '-1' '-v' '-w' '/tmp/graph10573131065585746429.weights' '-q' '0' '-e' '0.001'
[2022-05-14 19:46:04] [INFO ] Decomposing Gal with order
[2022-05-14 19:46:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 19:46:04] [INFO ] Removed a total of 6477 redundant transitions.
[2022-05-14 19:46:04] [INFO ] Flatten gal took : 453 ms
[2022-05-14 19:46:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 35 ms.
[2022-05-14 19:46:04] [INFO ] Time to serialize gal into /tmp/LTL11888406761817833781.gal : 9 ms
[2022-05-14 19:46:04] [INFO ] Time to serialize properties into /tmp/LTL14527152156075823477.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/LTL11888406761817833781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14527152156075823477.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/LTL1188840...268
Read 1 LTL properties
Checking formula 0 : !((X(G(((G(F("(gu2.SORTI_A_0>(gu2.CONTROLEUR_0+gu2.CONTROLEUR_1))")))||("(gi0.gu0.ATTENTE_A_0<1)"))||("((gu2.CONTROLEUR_0+gu2.CONTROLE...170
Formula 0 simplified : !XG("((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)>=1)" | "(gi0.gu0.ATTENTE_A_0<1)" | GF"(gu2.SORTI_A_0>(gu2.CONTROLEUR_0+gu2.CONTROLEUR_1))"...156
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16532090739395639504
[2022-05-14 19:46:19] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16532090739395639504
Running compilation step : cd /tmp/ltsmin16532090739395639504;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16532090739395639504;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16532090739395639504;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 finished in 56074 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||X(G(F(p1)))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 220 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:46:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:46:23] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
[2022-05-14 19:46:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:46:24] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-05-14 19:46:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:46:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:25] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1343 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 196 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s0), p1:(LEQ 3 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 412 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13 finished in 2587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))&&(G(X(X(p1)))||p2))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 15 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:46:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:46:25] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 19:46:26] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
[2022-05-14 19:46:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:46:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:46:26] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-05-14 19:46:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-14 19:46:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:46:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:27] [INFO ] Implicit Places using invariants and state equation in 844 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1175 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s53 s52), p0:(LEQ s54 s107), p1:(GT 3 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 431 steps with 4 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15 finished in 2066 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(G((G(p0) U p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p1))||p0))))'
Found a SL insensitive property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 2347
Applied a total of 3 rules in 39 ms. Remains 136 /138 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:46:28] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-14 19:46:28] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:46:28] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
[2022-05-14 19:46:28] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-14 19:46:28] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 19:46:28] [INFO ] Implicit Places using invariants in 270 ms returned []
[2022-05-14 19:46:28] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-14 19:46:28] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:46:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:29] [INFO ] Implicit Places using invariants and state equation in 782 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1056 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 135/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 28 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 135/138 places, 2347/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 1 s54) (LEQ 1 (ADD s108 s109))), p1:(GT s52 (ADD s108 s109))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2170 reset in 661 ms.
Product exploration explored 100000 steps with 2002 reset in 670 ms.
Computed a total of 108 stabilizing places and 203 stable transitions
Graph (complete) has 3743 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 108 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 259 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 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 414 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 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 14 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:46:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:32] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:46:32] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
[2022-05-14 19:46:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:32] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:46:33] [INFO ] Implicit Places using invariants in 265 ms returned []
[2022-05-14 19:46:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:46:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:33] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2022-05-14 19:46:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:33] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:46:34] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2347/2347 transitions.
Computed a total of 108 stabilizing places and 203 stable transitions
Graph (complete) has 3743 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 108 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 269 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 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 366 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 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2022 reset in 665 ms.
Product exploration explored 100000 steps with 2018 reset in 684 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 206 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:46:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:37] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:46:38] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
[2022-05-14 19:46:38] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-14 19:46:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:38] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 19:46:38] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2347/2347 transitions.
Product exploration explored 100000 steps with 2012 reset in 722 ms.
Product exploration explored 100000 steps with 2084 reset in 736 ms.
Built C files in :
/tmp/ltsmin1333918236850694848
[2022-05-14 19:46:40] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1333918236850694848
Running compilation step : cd /tmp/ltsmin1333918236850694848;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1333918236850694848;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1333918236850694848;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 17 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:46:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:43] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 19:46:44] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
[2022-05-14 19:46:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:44] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 19:46:44] [INFO ] Implicit Places using invariants in 253 ms returned []
[2022-05-14 19:46:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:44] [INFO ] Computed 6 place invariants in 11 ms
[2022-05-14 19:46:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:45] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2022-05-14 19:46:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 19:46:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 19:46:45] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin4380476130683105745
[2022-05-14 19:46:45] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4380476130683105745
Running compilation step : cd /tmp/ltsmin4380476130683105745;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4380476130683105745;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4380476130683105745;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 19:46:48] [INFO ] Flatten gal took : 70 ms
[2022-05-14 19:46:49] [INFO ] Flatten gal took : 90 ms
[2022-05-14 19:46:49] [INFO ] Time to serialize gal into /tmp/LTL1091336871477039430.gal : 8 ms
[2022-05-14 19:46:49] [INFO ] Time to serialize properties into /tmp/LTL8362730305611784376.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/LTL1091336871477039430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8362730305611784376.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/LTL1091336...266
Read 1 LTL properties
Checking formula 0 : !((X(G(((G(F("(SORTI_A_0>(CONTROLEUR_0+CONTROLEUR_1))")))||("(ATTENTE_A_0<1)"))||("((CONTROLEUR_0+CONTROLEUR_1)>=1)")))))
Formula 0 simplified : !XG("((CONTROLEUR_0+CONTROLEUR_1)>=1)" | "(ATTENTE_A_0<1)" | GF"(SORTI_A_0>(CONTROLEUR_0+CONTROLEUR_1))")
Detected timeout of ITS tools.
[2022-05-14 19:47:04] [INFO ] Flatten gal took : 69 ms
[2022-05-14 19:47:04] [INFO ] Applying decomposition
[2022-05-14 19:47:04] [INFO ] Flatten gal took : 71 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/graph11430234107535374379.txt' '-o' '/tmp/graph11430234107535374379.bin' '-w' '/tmp/graph11430234107535374379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11430234107535374379.bin' '-l' '-1' '-v' '-w' '/tmp/graph11430234107535374379.weights' '-q' '0' '-e' '0.001'
[2022-05-14 19:47:04] [INFO ] Decomposing Gal with order
[2022-05-14 19:47:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 19:47:06] [INFO ] Removed a total of 4334 redundant transitions.
[2022-05-14 19:47:06] [INFO ] Flatten gal took : 1806 ms
[2022-05-14 19:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2518 labels/synchronizations in 99 ms.
[2022-05-14 19:47:06] [INFO ] Time to serialize gal into /tmp/LTL11075976767339658554.gal : 5 ms
[2022-05-14 19:47:06] [INFO ] Time to serialize properties into /tmp/LTL11479187819352626419.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/LTL11075976767339658554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11479187819352626419.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/LTL1107597...268
Read 1 LTL properties
Checking formula 0 : !((X(G(((G(F("(gu2.SORTI_A_0>(gu2.CONTROLEUR_0+gu2.CONTROLEUR_1))")))||("(gi0.gu1.ATTENTE_A_0<1)"))||("((gu2.CONTROLEUR_0+gu2.CONTROLE...170
Formula 0 simplified : !XG("((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)>=1)" | "(gi0.gu1.ATTENTE_A_0<1)" | GF"(gu2.SORTI_A_0>(gu2.CONTROLEUR_0+gu2.CONTROLEUR_1))"...156
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8637476345023883067
[2022-05-14 19:47:21] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8637476345023883067
Running compilation step : cd /tmp/ltsmin8637476345023883067;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8637476345023883067;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8637476345023883067;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 finished in 56752 ms.
[2022-05-14 19:47:24] [INFO ] Flatten gal took : 93 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3455206363316309373
[2022-05-14 19:47:24] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2022-05-14 19:47:24] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3455206363316309373
Running compilation step : cd /tmp/ltsmin3455206363316309373;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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-14 19:47:24] [INFO ] Applying decomposition
[2022-05-14 19:47:24] [INFO ] Flatten gal took : 69 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/graph5304212470460000999.txt' '-o' '/tmp/graph5304212470460000999.bin' '-w' '/tmp/graph5304212470460000999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5304212470460000999.bin' '-l' '-1' '-v' '-w' '/tmp/graph5304212470460000999.weights' '-q' '0' '-e' '0.001'
[2022-05-14 19:47:24] [INFO ] Decomposing Gal with order
[2022-05-14 19:47:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 19:47:26] [INFO ] Removed a total of 4384 redundant transitions.
[2022-05-14 19:47:26] [INFO ] Flatten gal took : 1691 ms
[2022-05-14 19:47:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2616 labels/synchronizations in 98 ms.
[2022-05-14 19:47:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality6171886390310597055.gal : 5 ms
[2022-05-14 19:47:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality16139264971629980169.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/LTLCardinality6171886390310597055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16139264971629980169.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 3 LTL properties
Checking formula 0 : !((F((G("(gu1.ROUTE_A_0<=gu1.SORTI_B_0)"))||(F(G((G("(gu1.ROUTE_A_0<=gu1.SORTI_B_0)"))U("(gu1.ROUTE_A_0<=gu1.SORTI_B_0)")))))))
Formula 0 simplified : !F(G"(gu1.ROUTE_A_0<=gu1.SORTI_B_0)" | FG(G"(gu1.ROUTE_A_0<=gu1.SORTI_B_0)" U "(gu1.ROUTE_A_0<=gu1.SORTI_B_0)"))
Compilation finished in 5418 ms.
Running link step : cd /tmp/ltsmin3455206363316309373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin3455206363316309373;'/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))||<>([](([]((LTLAPp0==true)) U (LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin3455206363316309373;'/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))||<>([](([]((LTLAPp0==true)) U (LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3455206363316309373;'/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)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-14 20:09:07] [INFO ] Applying decomposition
[2022-05-14 20:09:07] [INFO ] Flatten gal took : 190 ms
[2022-05-14 20:09:08] [INFO ] Decomposing Gal with order
[2022-05-14 20:09:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 20:09:08] [INFO ] Removed a total of 13270 redundant transitions.
[2022-05-14 20:09:08] [INFO ] Flatten gal took : 458 ms
[2022-05-14 20:09:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 47 ms.
[2022-05-14 20:09:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality8386154111465041577.gal : 17 ms
[2022-05-14 20:09:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality6277131281359094513.ltl : 11 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/LTLCardinality8386154111465041577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6277131281359094513.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 : !((F((G("(gROUTE_A.ROUTE_A_0<=gSORTI_B.SORTI_B_0)"))||(F(G((G("(gROUTE_A.ROUTE_A_0<=gSORTI_B.SORTI_B_0)"))U("(gROUTE_A.ROUTE_A_0<=gSOR...178
Formula 0 simplified : !F(G"(gROUTE_A.ROUTE_A_0<=gSORTI_B.SORTI_B_0)" | FG(G"(gROUTE_A.ROUTE_A_0<=gSORTI_B.SORTI_B_0)" U "(gROUTE_A.ROUTE_A_0<=gSORTI_B.SOR...165
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin3455206363316309373;'/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)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3455206363316309373;'/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' 'X([](([](<>((LTLAPp3==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-14 20:30:50] [INFO ] Flatten gal took : 215 ms
[2022-05-14 20:30:50] [INFO ] Input system was already deterministic with 2348 transitions.
[2022-05-14 20:30:50] [INFO ] Transformed 138 places.
[2022-05-14 20:30:50] [INFO ] Transformed 2348 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-14 20:30:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality12978432485761535903.gal : 13 ms
[2022-05-14 20:30:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality5570513757923204865.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/LTLCardinality12978432485761535903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5570513757923204865.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...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(ROUTE_A_0<=SORTI_B_0)"))||(F(G((G("(ROUTE_A_0<=SORTI_B_0)"))U("(ROUTE_A_0<=SORTI_B_0)")))))))
Formula 0 simplified : !F(G"(ROUTE_A_0<=SORTI_B_0)" | FG(G"(ROUTE_A_0<=SORTI_B_0)" U "(ROUTE_A_0<=SORTI_B_0)"))
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-COL-V50P50N20"
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-COL-V50P50N20, 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-165251918100099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N20.tgz
mv BridgeAndVehicles-COL-V50P50N20 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 ;