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-165251918200196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P10N50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 20K Apr 29 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 29 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 220K Apr 29 23:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 819K Apr 29 23:13 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 4.5K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 120K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 335K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.9K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652583110683

Running Version 202205111006
[2022-05-15 02:51:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 02:51:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 02:51:52] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2022-05-15 02:51:52] [INFO ] Transformed 108 places.
[2022-05-15 02:51:52] [INFO ] Transformed 2228 transitions.
[2022-05-15 02:51:52] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 339 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 33 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 02:51:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:51:52] [INFO ] Computed 5 place invariants in 22 ms
[2022-05-15 02:51:53] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
[2022-05-15 02:51:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:51:53] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:51:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-15 02:51:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:51:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:51:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:51:53] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2022-05-15 02:51:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:51:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:51:54] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2228/2228 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/108 places, 2228/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2022-05-15 02:51:54] [INFO ] Flatten gal took : 219 ms
[2022-05-15 02:51:55] [INFO ] Flatten gal took : 202 ms
[2022-05-15 02:51:56] [INFO ] Input system was already deterministic with 2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 23) seen :18
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 02:51:57] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:51:57] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 02:51:57] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:51:57] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 02:51:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:51:57] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 02:51:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:51:58] [INFO ] After 175ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 02:51:58] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 204 ms.
[2022-05-15 02:51:58] [INFO ] After 942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 7 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Applied a total of 5 rules in 430 ms. Remains 103 /106 variables (removed 3) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/106 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 213231 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213231 steps, saw 61313 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-15 02:52:02] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2022-05-15 02:52:02] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 02:52:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 02:52:02] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 02:52:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 02:52:03] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 02:52:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:03] [INFO ] After 172ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 02:52:03] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 154 ms.
[2022-05-15 02:52:03] [INFO ] After 851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 81 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 247 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2226/2226 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 316 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2022-05-15 02:52:04] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2022-05-15 02:52:04] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-15 02:52:04] [INFO ] Implicit Places using invariants in 270 ms returned []
[2022-05-15 02:52:04] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2022-05-15 02:52:04] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-15 02:52:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:05] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1405 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 198 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 101/103 places, 2226/2226 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 205036 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205036 steps, saw 59223 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-15 02:52:09] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-15 02:52:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 02:52:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 02:52:09] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 02:52:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 02:52:10] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 02:52:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:10] [INFO ] After 257ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 02:52:10] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-15 02:52:10] [INFO ] After 804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 23 ms.
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 168 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2226/2226 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 164 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2022-05-15 02:52:11] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-15 02:52:11] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 02:52:11] [INFO ] Implicit Places using invariants in 261 ms returned []
[2022-05-15 02:52:11] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-15 02:52:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 02:52:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:11] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2022-05-15 02:52:12] [INFO ] Redundant transitions in 119 ms returned []
[2022-05-15 02:52:12] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-15 02:52:12] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 02:52:12] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2226/2226 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 101 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 101 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 99 transition count 286
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1943 place count 99 transition count 286
Applied a total of 1943 rules in 14 ms. Remains 99 /101 variables (removed 2) and now considering 286/2226 (removed 1940) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:52:12] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 02:52:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 02:52:12] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 02:52:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 02:52:13] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 02:52:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 02:52:13] [INFO ] After 64ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 02:52:13] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-15 02:52:13] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-15 02:52:13] [INFO ] Flatten gal took : 14 ms
[2022-05-15 02:52:13] [INFO ] Flatten gal took : 11 ms
[2022-05-15 02:52:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14129886622046800527.gal : 4 ms
[2022-05-15 02:52:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15562136606254712407.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms18194300888012173724;'/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/ReachabilityCardinality14129886622046800527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15562136606254712407.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15562136606254712407.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 25
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :25 after 45
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :45 after 75
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :75 after 133
Reachability property AtomicPropp17 is true.
Reachability property AtomicPropp0 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :133 after 254
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :254 after 11430
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :11430 after 330708
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :330708 after 3.85572e+06
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,1.34366e+07,0.302525,11636,2,2715,18,26031,7,0,690,19267,0
Total reachable state count : 13436600

Verifying 3 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,1,0.304413,11900,2,100,18,26031,8,0,696,19267,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,21,0.305669,11900,2,100,18,26031,8,0,702,19267,0
Reachability property AtomicPropp17 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
AtomicPropp17,1,0.305966,11900,2,100,18,26031,9,0,703,19267,0
Computed a total of 49 stabilizing places and 84 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p1)&&p0))))'
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 438 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:52:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:52:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:52:15] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
[2022-05-15 02:52:15] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:52:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:15] [INFO ] Implicit Places using invariants in 318 ms returned []
[2022-05-15 02:52:15] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:52:15] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 02:52:16] [INFO ] Implicit Places using invariants and state equation in 586 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 912 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 277 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s47 1) (LT s102 1)) (OR (LT s48 1) (LT s102 1))), p1:(OR (AND (GEQ s23 10) (GEQ s50 1)) (AND (GEQ s23 10) (GEQ s49 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 10 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-01 finished in 2479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))&&G(F(!p0)))))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2224
Applied a total of 9 rules in 378 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
[2022-05-15 02:52:16] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2022-05-15 02:52:16] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 02:52:17] [INFO ] Implicit Places using invariants in 170 ms returned []
[2022-05-15 02:52:17] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2022-05-15 02:52:17] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 02:52:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:17] [INFO ] Implicit Places using invariants and state equation in 619 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 797 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 2224/2228 transitions.
Applied a total of 0 rules in 268 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/106 places, 2224/2228 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), p0]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s20 1) (LT s23 1) (LT s24 1) (LT s88 1)) (OR (LT s3 1) (LT s23 1) (LT s24 1) (LT s94 1)) (OR (LT s13 1) (LT s23 1) (LT s24 1) (LT s59 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 8 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-02 finished in 1592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X(X(p1)))) U !(G(F(p2)) U p3)))'
Support contains 78 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 23 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 02:52:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:18] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
[2022-05-15 02:52:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:18] [INFO ] Implicit Places using invariants in 118 ms returned []
[2022-05-15 02:52:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:19] [INFO ] Implicit Places using invariants and state equation in 610 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 734 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 828 ms :[p3, (NOT p1), (AND (NOT p1) p2 p3), (AND p2 p3), (NOT p1), (NOT p1), (NOT p1), true, (AND p3 (NOT p1) p2), (AND (NOT p1) p2 p3), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND p3 (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND p2 p3)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={0, 1} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 9}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND p3 p0), acceptance={} source=2 dest: 11}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p3), acceptance={0, 1} source=3 dest: 3}, { cond=p3, acceptance={} source=3 dest: 12}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 13}, { cond=p0, acceptance={} source=5 dest: 14}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 15}, { cond=p3, acceptance={} source=8 dest: 16}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=9 dest: 17}, { cond=(AND p3 p0), acceptance={} source=9 dest: 18}], [{ cond=true, acceptance={} source=10 dest: 16}], [{ cond=(NOT p0), acceptance={} source=11 dest: 17}, { cond=p0, acceptance={} source=11 dest: 18}], [{ cond=(NOT p0), acceptance={} source=12 dest: 10}, { cond=p0, acceptance={} source=12 dest: 11}], [{ cond=(NOT p1), acceptance={} source=13 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=14 dest: 14}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=15 dest: 19}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=15 dest: 20}], [{ cond=(NOT p1), acceptance={} source=16 dest: 19}], [{ cond=(NOT p1), acceptance={} source=17 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=18 dest: 17}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=18 dest: 18}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=18 dest: 18}], [{ cond=(NOT p2), acceptance={1} source=19 dest: 19}, { cond=p2, acceptance={0, 1} source=19 dest: 19}], [{ cond=p3, acceptance={} source=20 dest: 19}, { cond=(NOT p3), acceptance={} source=20 dest: 20}]], initial=0, aps=[p3:(OR (AND (GEQ s30 1) (GEQ s53 1)) (AND (GEQ s35 1) (GEQ s53 1)) (AND (GEQ s37 1) (GEQ s53 1)) (AND (GEQ s42 1) (GEQ s53 1)) (AND (GEQ s40 1) (GEQ s53 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-03 finished in 2227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U ((G(p2)||p1) U p3))||G(p2)))'
Support contains 26 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 287 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 02:52:20] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:52:21] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
[2022-05-15 02:52:21] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:21] [INFO ] Implicit Places using invariants in 229 ms returned []
[2022-05-15 02:52:21] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:22] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1292 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 277 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s30 1) (GEQ s52 1)) (AND (GEQ s35 1) (GEQ s52 1)) (AND (GEQ s37 1) (GEQ s52 1)) (AND (GEQ s42 1) (GEQ s52 1)) (AND (GEQ s40 1) (GEQ s52 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-04 finished in 2699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 22 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 12 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:52:23] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:52:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:23] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
[2022-05-15 02:52:23] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:52:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:23] [INFO ] Implicit Places using invariants in 230 ms returned []
[2022-05-15 02:52:23] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:52:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:24] [INFO ] Implicit Places using invariants and state equation in 556 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 796 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s16 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (L...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-05 finished in 1503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X((p0 U p1))&&p1)) U p2))'
Support contains 77 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 02:52:24] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:24] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:52:25] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
[2022-05-15 02:52:25] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:52:25] [INFO ] Implicit Places using invariants in 125 ms returned []
[2022-05-15 02:52:25] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:52:25] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 02:52:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:25] [INFO ] Implicit Places using invariants and state equation in 525 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 663 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 15 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p2), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s23 10) (GEQ s51 1)) (AND (GEQ s23 10) (GEQ s50 1))), p0:(GEQ s22 1), p2:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s31 1) (GEQ s56 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-06 finished in 1421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2224
Applied a total of 9 rules in 275 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
[2022-05-15 02:52:26] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2022-05-15 02:52:26] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 02:52:26] [INFO ] Implicit Places using invariants in 128 ms returned []
[2022-05-15 02:52:26] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2022-05-15 02:52:26] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 02:52:26] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:52:26] [INFO ] Implicit Places using invariants and state equation in 527 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 661 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 2224/2228 transitions.
Applied a total of 0 rules in 231 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/106 places, 2224/2228 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s22 1) (GEQ s29 1) (GEQ s51 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s26 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s22 1) (GEQ s31 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2383 reset in 3546 ms.
Product exploration explored 100000 steps with 2246 reset in 3504 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2022-05-15 02:52:34] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:52:35] [INFO ] Computed 4 place invariants in 3 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 02:52:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 73 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 236 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2022-05-15 02:52:55] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:52:55] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 02:52:55] [INFO ] Implicit Places using invariants in 128 ms returned []
[2022-05-15 02:52:55] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:52:55] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 02:52:55] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2022-05-15 02:52:55] [INFO ] Redundant transitions in 51 ms returned []
[2022-05-15 02:52:55] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:52:55] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 02:52:56] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 2224/2224 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2022-05-15 02:52:56] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:52:56] [INFO ] Computed 4 place invariants in 4 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 02:53:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2313 reset in 3531 ms.
Product exploration explored 100000 steps with 2298 reset in 3564 ms.
Built C files in :
/tmp/ltsmin304695869435069914
[2022-05-15 02:53:23] [INFO ] Too many transitions (2224) to apply POR reductions. Disabling POR matrices.
[2022-05-15 02:53:23] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin304695869435069914
Running compilation step : cd /tmp/ltsmin304695869435069914;'/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/ltsmin304695869435069914;'/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/ltsmin304695869435069914;'/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 73 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 218 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2022-05-15 02:53:26] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:53:26] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 02:53:26] [INFO ] Implicit Places using invariants in 129 ms returned []
[2022-05-15 02:53:26] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:53:26] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 02:53:26] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2022-05-15 02:53:26] [INFO ] Redundant transitions in 119 ms returned []
[2022-05-15 02:53:26] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-15 02:53:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 02:53:27] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 2224/2224 transitions.
Built C files in :
/tmp/ltsmin14013305692079705900
[2022-05-15 02:53:27] [INFO ] Too many transitions (2224) to apply POR reductions. Disabling POR matrices.
[2022-05-15 02:53:27] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14013305692079705900
Running compilation step : cd /tmp/ltsmin14013305692079705900;'/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/ltsmin14013305692079705900;'/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/ltsmin14013305692079705900;'/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-15 02:53:31] [INFO ] Flatten gal took : 107 ms
[2022-05-15 02:53:31] [INFO ] Flatten gal took : 108 ms
[2022-05-15 02:53:31] [INFO ] Time to serialize gal into /tmp/LTL3711289235709189708.gal : 18 ms
[2022-05-15 02:53:31] [INFO ] Time to serialize properties into /tmp/LTL9941985767109024980.ltl : 10 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/LTL3711289235709189708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9941985767109024980.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/LTL3711289...266
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&((NB_ATTENTE_B_5>=1)&&(COMPTEUR_3>=1)))||(((NB_ATTENTE_A_0>=1)&&(CONTROLEUR...89128
Formula 0 simplified : !F"(((((((((((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&((NB_ATTENTE_B_5>=1)&&(COMPTEUR_3>=1)))||(((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_...89124
Detected timeout of ITS tools.
[2022-05-15 02:53:46] [INFO ] Flatten gal took : 104 ms
[2022-05-15 02:53:46] [INFO ] Applying decomposition
[2022-05-15 02:53:46] [INFO ] Flatten gal took : 105 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/graph5948979831101724091.txt' '-o' '/tmp/graph5948979831101724091.bin' '-w' '/tmp/graph5948979831101724091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5948979831101724091.bin' '-l' '-1' '-v' '-w' '/tmp/graph5948979831101724091.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:53:46] [INFO ] Decomposing Gal with order
[2022-05-15 02:53:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:53:47] [INFO ] Removed a total of 4275 redundant transitions.
[2022-05-15 02:53:47] [INFO ] Flatten gal took : 868 ms
[2022-05-15 02:53:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 297 labels/synchronizations in 33 ms.
[2022-05-15 02:53:47] [INFO ] Time to serialize gal into /tmp/LTL10243979095803925826.gal : 2 ms
[2022-05-15 02:53:47] [INFO ] Time to serialize properties into /tmp/LTL3992463600320717474.ltl : 14 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/LTL10243979095803925826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3992463600320717474.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/LTL1024397...246
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((((i0.u2.NB_ATTENTE_A_0>=1)&&(i0.u2.CONTROLEUR_1>=1))&&((i0.u2.NB_ATTENTE_B_5>=1)&&(i0.u0.COMPTEUR_3>=1)))||(((i0.u2.N...113608
Formula 0 simplified : !F"(((((((((((((i0.u2.NB_ATTENTE_A_0>=1)&&(i0.u2.CONTROLEUR_1>=1))&&((i0.u2.NB_ATTENTE_B_5>=1)&&(i0.u0.COMPTEUR_3>=1)))||(((i0.u2.NB...113604
Reverse transition relation is NOT exact ! Due to transitions t0, t45, t36_t21, t2208_t21, t2222_t21, t1323_t42, i0.t181_t43, Intersection with reachable ...223
Computing Next relation with stutter on 40 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6391689836795077016
[2022-05-15 02:54:03] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6391689836795077016
Running compilation step : cd /tmp/ltsmin6391689836795077016;'/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/ltsmin6391689836795077016;'/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/ltsmin6391689836795077016;'/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-PT-V20P10N50-LTLFireability-07 finished in 100046 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(F(p0) U (!X(p1)||(X(G(p3))&&p2))))))'
Support contains 9 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 19 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:54:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:54:06] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
[2022-05-15 02:54:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:54:07] [INFO ] Implicit Places using invariants in 246 ms returned []
[2022-05-15 02:54:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:54:07] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2022-05-15 02:54:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:54:08] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 2227/2228 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 461 ms :[(OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (AND p0 p2 p3) (AND p0 (NOT p1))), (NOT p1), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1) p3) (AND p0 p2 p3)), (AND (NOT p1) p3), (AND p0 (NOT p1) p3)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={0, 1} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={1} source=2 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) p3), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2) p3), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p2 p3), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p2 p3), acceptance={1} source=6 dest: 6}, { cond=(AND p0 (NOT p2) p3), acceptance={0, 1} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={1} source=6 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p1) p3), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0} source=8 dest: 4}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1) p3), acceptance={1} source=8 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0, 1} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={1} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)), p2:(AND (GEQ s4 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)), p1:(AND (GEQ s24 1) (GEQ s26 1) (GEQ s33...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1457 reset in 828 ms.
Product exploration explored 100000 steps with 1442 reset in 768 ms.
Computed a total of 48 stabilizing places and 83 stable transitions
Computed a total of 48 stabilizing places and 83 stable transitions
Detected a total of 48/105 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p3)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 2900 ms. Reduced automaton from 9 states, 41 edges and 4 AP to 9 states, 41 edges and 4 AP.
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (AND p0 p2 p3) (AND p0 (NOT p1))), (NOT p1), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1) p3) (AND p0 p2 p3)), (AND (NOT p1) p3), (AND p0 (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 22) seen :12
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-05-15 02:54:15] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:54:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:54:15] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 10 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p3)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p0 p3 (NOT p2)))), (G (NOT (AND p3 p2))), (G (NOT (AND (NOT p0) p3 p2))), (G (NOT (AND p0 p3 p2))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p0) p2 (NOT p1)))), (G (NOT (AND p3 p2 (NOT p1)))), (G (NOT (AND p0 p3 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) p3 p2 (NOT p1)))), (G (NOT (AND p0 p3 p2 (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND p0 (NOT p1))), (F p1), (F (AND p0 p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p3 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) p3 (NOT p2) (NOT p1))), (F (AND p0 p2)), (F p2), (F (AND p3 (NOT p2))), (F (AND (NOT p0) p3 (NOT p2)))]
Knowledge based reduction with 27 factoid took 3599 ms. Reduced automaton from 9 states, 41 edges and 4 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
[2022-05-15 02:54:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:19] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:54:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 02:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:54:19] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-15 02:54:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:54:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 02:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:54:20] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-15 02:54:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:54:20] [INFO ] [Nat]Added 102 Read/Feed constraints in 28 ms returned sat
[2022-05-15 02:54:20] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 131 ms.
[2022-05-15 02:54:20] [INFO ] Added : 55 causal constraints over 12 iterations in 423 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2227/2227 transitions.
Applied a total of 0 rules in 13 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:54:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:20] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:54:21] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
[2022-05-15 02:54:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:54:21] [INFO ] Implicit Places using invariants in 247 ms returned []
[2022-05-15 02:54:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:21] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:54:22] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2022-05-15 02:54:22] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:22] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:54:22] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 2227/2227 transitions.
Computed a total of 48 stabilizing places and 83 stable transitions
Computed a total of 48 stabilizing places and 83 stable transitions
Detected a total of 48/105 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 508 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
Finished random walk after 161 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p3))), (F (AND p0 (NOT p3) (NOT p1))), (F p0)]
Knowledge based reduction with 10 factoid took 627 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
[2022-05-15 02:54:24] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:54:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 02:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:54:24] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-15 02:54:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:54:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 02:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:54:25] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-15 02:54:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:54:25] [INFO ] [Nat]Added 102 Read/Feed constraints in 25 ms returned sat
[2022-05-15 02:54:25] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 65 ms.
[2022-05-15 02:54:25] [INFO ] Added : 55 causal constraints over 12 iterations in 325 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 776 reset in 815 ms.
Product exploration explored 100000 steps with 761 reset in 807 ms.
Built C files in :
/tmp/ltsmin3537791981314525833
[2022-05-15 02:54:27] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3537791981314525833
Running compilation step : cd /tmp/ltsmin3537791981314525833;'/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/ltsmin3537791981314525833;'/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/ltsmin3537791981314525833;'/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 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2227/2227 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:54:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:30] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:54:31] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
[2022-05-15 02:54:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:54:31] [INFO ] Implicit Places using invariants in 247 ms returned []
[2022-05-15 02:54:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:31] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:54:32] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2022-05-15 02:54:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:54:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:54:32] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin17934791521999856992
[2022-05-15 02:54:32] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17934791521999856992
Running compilation step : cd /tmp/ltsmin17934791521999856992;'/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/ltsmin17934791521999856992;'/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/ltsmin17934791521999856992;'/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-15 02:54:36] [INFO ] Flatten gal took : 77 ms
[2022-05-15 02:54:36] [INFO ] Flatten gal took : 79 ms
[2022-05-15 02:54:36] [INFO ] Time to serialize gal into /tmp/LTL5204130752152403887.gal : 12 ms
[2022-05-15 02:54:36] [INFO ] Time to serialize properties into /tmp/LTL17634383539691390549.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/LTL5204130752152403887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17634383539691390549.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/LTL5204130...267
Read 1 LTL properties
Checking formula 0 : !((F(X(!((F("(((NB_ATTENTE_A_3>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))"))U((!(X("(((CAPACITE>=1)&&(CONTROLEUR_2>=1))...344
Formula 0 simplified : !FX!(F"(((NB_ATTENTE_A_3>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))" U (!X"(((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&((NB_...318
Detected timeout of ITS tools.
[2022-05-15 02:54:51] [INFO ] Flatten gal took : 75 ms
[2022-05-15 02:54:51] [INFO ] Applying decomposition
[2022-05-15 02:54:51] [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/graph6757424732960809500.txt' '-o' '/tmp/graph6757424732960809500.bin' '-w' '/tmp/graph6757424732960809500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6757424732960809500.bin' '-l' '-1' '-v' '-w' '/tmp/graph6757424732960809500.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:54:51] [INFO ] Decomposing Gal with order
[2022-05-15 02:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:54:52] [INFO ] Removed a total of 4293 redundant transitions.
[2022-05-15 02:54:52] [INFO ] Flatten gal took : 652 ms
[2022-05-15 02:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 393 labels/synchronizations in 27 ms.
[2022-05-15 02:54:52] [INFO ] Time to serialize gal into /tmp/LTL1360227940494325920.gal : 2 ms
[2022-05-15 02:54:52] [INFO ] Time to serialize properties into /tmp/LTL6092991257568754559.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/LTL1360227940494325920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6092991257568754559.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/LTL1360227...245
Read 1 LTL properties
Checking formula 0 : !((F(X(!((F("(((i2.u2.NB_ATTENTE_A_3>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u1.CAPACITE>=1)&&(i1.u4.CONTROLEUR_1>=1)))"))U((!(X("(((i0.u1.CA...428
Formula 0 simplified : !FX!(F"(((i2.u2.NB_ATTENTE_A_3>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u1.CAPACITE>=1)&&(i1.u4.CONTROLEUR_1>=1)))" U (!X"(((i0.u1.CAPACITE>...402
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10860719420462936618
[2022-05-15 02:55:07] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10860719420462936618
Running compilation step : cd /tmp/ltsmin10860719420462936618;'/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/ltsmin10860719420462936618;'/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/ltsmin10860719420462936618;'/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-PT-V20P10N50-LTLFireability-08 finished in 64370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X((!(!F(p1) U p1)&&p0)) U p2))'
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 18 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:55:10] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:55:10] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:55:11] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
[2022-05-15 02:55:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:55:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:11] [INFO ] Implicit Places using invariants in 254 ms returned []
[2022-05-15 02:55:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:55:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:11] [INFO ] Implicit Places using invariants and state equation in 571 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 828 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 13 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, p2, (OR (AND (NOT p0) p2) (AND p1 p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p1 p2) (AND (NOT p0) p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (GEQ s47 1) (GEQ s102 1)), p1:(AND (GEQ s23 10) (GEQ s49 1)), p0:(AND (GEQ s1 1) (GEQ s24 1) (GEQ s40 1) (GEQ s62 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 602 reset in 845 ms.
Product exploration explored 100000 steps with 602 reset in 785 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 250432 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250432 steps, saw 65954 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 02:55:17] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:55:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:17] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:55:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:17] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:55:17] [INFO ] After 236ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:18] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 198 ms.
[2022-05-15 02:55:18] [INFO ] After 898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 109 ms.
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 205 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:55:18] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:19] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 265579 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265579 steps, saw 69473 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 02:55:22] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:22] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:55:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:22] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:55:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:22] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:55:23] [INFO ] After 230ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:23] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 196 ms.
[2022-05-15 02:55:23] [INFO ] After 881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 78 ms.
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 170 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 157 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:55:23] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:23] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:55:24] [INFO ] Implicit Places using invariants in 241 ms returned []
[2022-05-15 02:55:24] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:55:25] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
[2022-05-15 02:55:25] [INFO ] Redundant transitions in 45 ms returned []
[2022-05-15 02:55:25] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:55:25] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 102 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1942 place count 102 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 10 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 100 cols
[2022-05-15 02:55:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:55:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:55:25] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:55:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:26] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 02:55:26] [INFO ] After 97ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:26] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-05-15 02:55:26] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:26] [INFO ] Flatten gal took : 12 ms
[2022-05-15 02:55:26] [INFO ] Flatten gal took : 8 ms
[2022-05-15 02:55:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6572606506519228102.gal : 2 ms
[2022-05-15 02:55:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7316855728841852418.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8789546181672376991;'/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/ReachabilityCardinality6572606506519228102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7316855728841852418.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/ReachabilityCardinality7316855728841852418.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :19 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 59
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :59 after 89
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :89 after 149
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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,253,0.117771,7488,2,257,13,6900,6,0,693,4983,0
Total reachable state count : 253

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.119178,7752,2,101,13,6900,7,0,711,4983,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.120046,7752,2,101,13,6900,8,0,719,4983,0
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 91 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 77 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 14 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:55:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:26] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:55:27] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
[2022-05-15 02:55:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:27] [INFO ] Implicit Places using invariants in 247 ms returned []
[2022-05-15 02:55:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:55:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:55:28] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2022-05-15 02:55:28] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:55:29] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 p2) (AND p2 (NOT p0))))), true, (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 p2) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 84 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 265835 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265835 steps, saw 69547 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 02:55:33] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:33] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:55:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 02:55:33] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:55:33] [INFO ] After 240ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:33] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 200 ms.
[2022-05-15 02:55:33] [INFO ] After 919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 112 ms.
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 157 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:55:34] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:55:34] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 249234 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249234 steps, saw 65637 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 02:55:38] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:38] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:55:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:38] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:55:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:38] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:55:38] [INFO ] After 241ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:38] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 199 ms.
[2022-05-15 02:55:39] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 97 ms.
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 163 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 157 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:55:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:55:39] [INFO ] Implicit Places using invariants in 248 ms returned []
[2022-05-15 02:55:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:39] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 02:55:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:55:40] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2022-05-15 02:55:40] [INFO ] Redundant transitions in 52 ms returned []
[2022-05-15 02:55:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:55:41] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 102 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1942 place count 102 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 11 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 100 cols
[2022-05-15 02:55:41] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:55:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:55:41] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:55:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:55:41] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 02:55:41] [INFO ] After 93ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:41] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-05-15 02:55:42] [INFO ] After 531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:55:42] [INFO ] Flatten gal took : 11 ms
[2022-05-15 02:55:42] [INFO ] Flatten gal took : 9 ms
[2022-05-15 02:55:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16705808882506844478.gal : 3 ms
[2022-05-15 02:55:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5403578986537603386.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17486254207241322048;'/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/ReachabilityCardinality16705808882506844478.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5403578986537603386.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/ReachabilityCardinality5403578986537603386.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :19 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 59
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :59 after 89
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :89 after 149
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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,253,0.117641,7492,2,257,13,7247,6,0,693,4980,0
Total reachable state count : 253

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.118834,7492,2,101,13,7247,7,0,707,4980,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.119688,7756,2,101,13,7247,8,0,716,4980,0
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 p2) (AND p2 (NOT p0))))), true, (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 p2) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 92 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 89 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 98 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 602 reset in 777 ms.
Product exploration explored 100000 steps with 602 reset in 778 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 264 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:55:44] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:55:45] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
[2022-05-15 02:55:45] [INFO ] Redundant transitions in 45 ms returned []
[2022-05-15 02:55:45] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:45] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:55:46] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Product exploration explored 100000 steps with 602 reset in 775 ms.
Product exploration explored 100000 steps with 602 reset in 752 ms.
Built C files in :
/tmp/ltsmin16048672716387172825
[2022-05-15 02:55:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16048672716387172825
Running compilation step : cd /tmp/ltsmin16048672716387172825;'/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/ltsmin16048672716387172825;'/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/ltsmin16048672716387172825;'/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 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 19 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:55:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:51] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
[2022-05-15 02:55:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:51] [INFO ] Implicit Places using invariants in 251 ms returned []
[2022-05-15 02:55:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:55:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:55:52] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
[2022-05-15 02:55:52] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:55:52] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:55:53] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin2036861343244817566
[2022-05-15 02:55:53] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2036861343244817566
Running compilation step : cd /tmp/ltsmin2036861343244817566;'/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/ltsmin2036861343244817566;'/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/ltsmin2036861343244817566;'/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-15 02:55:56] [INFO ] Flatten gal took : 73 ms
[2022-05-15 02:55:56] [INFO ] Flatten gal took : 75 ms
[2022-05-15 02:55:56] [INFO ] Time to serialize gal into /tmp/LTL3850757378425700935.gal : 12 ms
[2022-05-15 02:55:56] [INFO ] Time to serialize properties into /tmp/LTL11700396044942475514.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/LTL3850757378425700935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11700396044942475514.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/LTL3850757...267
Read 1 LTL properties
Checking formula 0 : !((!((!(X((((!((!(F("((CAPACITE>=10)&&(VIDANGE_1>=1))")))U("((CAPACITE>=10)&&(VIDANGE_1>=1))")))&&("(NB_ATTENTE_A_0>=1)"))&&("((CONTRO...256
Formula 0 simplified : !X("((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_14>=1))" & "(COMPTEUR_10>=1)" & "(NB_ATTENTE_A_0>=1)" & !(!F"((CAPACITE>=10)&&(VIDANGE_1>=1))"...231
Detected timeout of ITS tools.
[2022-05-15 02:56:11] [INFO ] Flatten gal took : 72 ms
[2022-05-15 02:56:11] [INFO ] Applying decomposition
[2022-05-15 02:56:11] [INFO ] Flatten gal took : 73 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/graph10437829283222343040.txt' '-o' '/tmp/graph10437829283222343040.bin' '-w' '/tmp/graph10437829283222343040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10437829283222343040.bin' '-l' '-1' '-v' '-w' '/tmp/graph10437829283222343040.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:56:11] [INFO ] Decomposing Gal with order
[2022-05-15 02:56:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:56:12] [INFO ] Removed a total of 4215 redundant transitions.
[2022-05-15 02:56:12] [INFO ] Flatten gal took : 555 ms
[2022-05-15 02:56:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 19 ms.
[2022-05-15 02:56:12] [INFO ] Time to serialize gal into /tmp/LTL692435740666192758.gal : 1 ms
[2022-05-15 02:56:12] [INFO ] Time to serialize properties into /tmp/LTL10446996635757062477.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/LTL692435740666192758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10446996635757062477.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/LTL6924357...245
Read 1 LTL properties
Checking formula 0 : !((!((!(X((((!((!(F("((i0.u1.CAPACITE>=10)&&(i1.u2.VIDANGE_1>=1))")))U("((i0.u1.CAPACITE>=10)&&(i1.u2.VIDANGE_1>=1))")))&&("(i0.u0.NB_...316
Formula 0 simplified : !X("((i0.u0.CONTROLEUR_1>=1)&&(i0.u0.NB_ATTENTE_B_14>=1))" & "(i0.u0.NB_ATTENTE_A_0>=1)" & "(i1.u3.COMPTEUR_10>=1)" & !(!F"((i0.u1.C...291
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4791137847203881774
[2022-05-15 02:56:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4791137847203881774
Running compilation step : cd /tmp/ltsmin4791137847203881774;'/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/ltsmin4791137847203881774;'/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/ltsmin4791137847203881774;'/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-PT-V20P10N50-LTLFireability-09 finished in 80185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(F(X(F((F(p0)||p1)))))))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 208 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:56:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:56:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:56:31] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
[2022-05-15 02:56:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:56:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:56:31] [INFO ] Implicit Places using invariants in 278 ms returned []
[2022-05-15 02:56:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:56:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:56:32] [INFO ] Implicit Places using invariants and state equation in 575 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 871 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 180 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s23 10) (LT s50 1)), p1:(AND (GEQ s23 1) (GEQ s25 1) (GEQ s31 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 639 reset in 732 ms.
Product exploration explored 100000 steps with 634 reset in 849 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 456 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 200 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:56:34] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 02:56:34] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:56:35] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
[2022-05-15 02:56:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 02:56:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:56:35] [INFO ] Implicit Places using invariants in 274 ms returned []
[2022-05-15 02:56:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 02:56:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:56:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:56:37] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2022-05-15 02:56:37] [INFO ] Redundant transitions in 53 ms returned []
[2022-05-15 02:56:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 02:56:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:56:37] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 2227/2227 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 111 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 643 reset in 749 ms.
Product exploration explored 100000 steps with 640 reset in 730 ms.
Built C files in :
/tmp/ltsmin5318092340336530764
[2022-05-15 02:56:39] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-15 02:56:39] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5318092340336530764
Running compilation step : cd /tmp/ltsmin5318092340336530764;'/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/ltsmin5318092340336530764;'/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/ltsmin5318092340336530764;'/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 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 184 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:56:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 02:56:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:56:43] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
[2022-05-15 02:56:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 02:56:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:56:44] [INFO ] Implicit Places using invariants in 269 ms returned []
[2022-05-15 02:56:44] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 02:56:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:56:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:56:45] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
[2022-05-15 02:56:45] [INFO ] Redundant transitions in 51 ms returned []
[2022-05-15 02:56:45] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 02:56:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:56:46] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin4767161382655723810
[2022-05-15 02:56:46] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-15 02:56:46] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4767161382655723810
Running compilation step : cd /tmp/ltsmin4767161382655723810;'/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/ltsmin4767161382655723810;'/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/ltsmin4767161382655723810;'/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-15 02:56:49] [INFO ] Flatten gal took : 87 ms
[2022-05-15 02:56:49] [INFO ] Flatten gal took : 69 ms
[2022-05-15 02:56:49] [INFO ] Time to serialize gal into /tmp/LTL2780151034567594656.gal : 9 ms
[2022-05-15 02:56:49] [INFO ] Time to serialize properties into /tmp/LTL8765562892374633149.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/LTL2780151034567594656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8765562892374633149.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/LTL2780151...266
Read 1 LTL properties
Checking formula 0 : !((G(F(X(G(F(X(F((F("((CAPACITE<10)||(VIDANGE_1<1))"))||("(((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_5>=1)&&(ATTENTE_B>=1)))"...165
Formula 0 simplified : !GFXGFXF("(((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_5>=1)&&(ATTENTE_B>=1)))" | F"((CAPACITE<10)||(VIDANGE_1<1))")
Detected timeout of ITS tools.
[2022-05-15 02:57:04] [INFO ] Flatten gal took : 69 ms
[2022-05-15 02:57:04] [INFO ] Applying decomposition
[2022-05-15 02:57:04] [INFO ] Flatten gal took : 70 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/graph18352191828650274988.txt' '-o' '/tmp/graph18352191828650274988.bin' '-w' '/tmp/graph18352191828650274988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18352191828650274988.bin' '-l' '-1' '-v' '-w' '/tmp/graph18352191828650274988.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:57:04] [INFO ] Decomposing Gal with order
[2022-05-15 02:57:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:57:05] [INFO ] Removed a total of 4254 redundant transitions.
[2022-05-15 02:57:05] [INFO ] Flatten gal took : 546 ms
[2022-05-15 02:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 20 ms.
[2022-05-15 02:57:05] [INFO ] Time to serialize gal into /tmp/LTL3954301460331603073.gal : 2 ms
[2022-05-15 02:57:05] [INFO ] Time to serialize properties into /tmp/LTL8581339339678984905.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/LTL3954301460331603073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8581339339678984905.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/LTL3954301...245
Read 1 LTL properties
Checking formula 0 : !((G(F(X(G(F(X(F((F("((i2.u0.CAPACITE<10)||(u1.VIDANGE_1<1))"))||("(((i2.u0.CAPACITE>=1)&&(u1.CONTROLEUR_2>=1))&&((i1.u3.NB_ATTENTE_B_...195
Formula 0 simplified : !GFXGFXF("(((i2.u0.CAPACITE>=1)&&(u1.CONTROLEUR_2>=1))&&((i1.u3.NB_ATTENTE_B_5>=1)&&(i2.u4.ATTENTE_B>=1)))" | F"((i2.u0.CAPACITE<10)...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13520906119326424390
[2022-05-15 02:57:20] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13520906119326424390
Running compilation step : cd /tmp/ltsmin13520906119326424390;'/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/ltsmin13520906119326424390;'/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/ltsmin13520906119326424390;'/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-PT-V20P10N50-LTLFireability-10 finished in 52919 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(p0)))||X(p1))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 02:57:23] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:23] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:57:24] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
[2022-05-15 02:57:24] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:24] [INFO ] Implicit Places using invariants in 307 ms returned []
[2022-05-15 02:57:24] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:57:26] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1883 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(LT s22 1), p0:(OR (LT s37 1) (LT s52 1))], 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]]
Product exploration explored 100000 steps with 33333 reset in 857 ms.
Product exploration explored 100000 steps with 33333 reset in 946 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/104 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-11 finished in 4780 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(F(X(p0)))))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 18 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:57:28] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:57:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:57:28] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2022-05-15 02:57:28] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:57:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:29] [INFO ] Implicit Places using invariants in 300 ms returned []
[2022-05-15 02:57:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:57:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:29] [INFO ] Implicit Places using invariants and state equation in 589 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 893 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 9 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s47 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 173 steps with 3 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-12 finished in 1749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X(((p0 U p2)||p1))))'
Support contains 7 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 02:57:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:30] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
[2022-05-15 02:57:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:57:30] [INFO ] Implicit Places using invariants in 234 ms returned []
[2022-05-15 02:57:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:57:32] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1637 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR p1 p2), (OR p1 p2), (OR p2 p1), true, p2, p2]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s22 1), p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s25 1) (GEQ s26 1) (GEQ s74 1))), p2:(AND (GEQ s2 1) (GEQ s25 1) (GEQ s26 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 909 ms.
Product exploration explored 100000 steps with 50000 reset in 969 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/104 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND p0 p1) (AND p0 p2))))
Knowledge based reduction with 15 factoid took 221 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-13 finished in 4569 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 02:57:34] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:35] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
[2022-05-15 02:57:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:57:35] [INFO ] Implicit Places using invariants in 298 ms returned []
[2022-05-15 02:57:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 02:57:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:57:37] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1842 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s22 1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-14 finished in 2548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U X(!F(p0))))))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 185 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:57:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:57:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:37] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
[2022-05-15 02:57:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:57:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:38] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-05-15 02:57:38] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:57:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:38] [INFO ] Implicit Places using invariants and state equation in 604 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 909 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 163 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s22 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 685 reset in 904 ms.
Product exploration explored 100000 steps with 685 reset in 783 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 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 140 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 40 ms :[p0]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
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 140 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 31 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 159 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:57:41] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:57:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:57:41] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
[2022-05-15 02:57:41] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:57:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:42] [INFO ] Implicit Places using invariants in 285 ms returned []
[2022-05-15 02:57:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:57:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:57:43] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2022-05-15 02:57:43] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-15 02:57:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:57:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:57:43] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 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 140 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 41 ms :[p0]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 159 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 33 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Product exploration explored 100000 steps with 685 reset in 770 ms.
Product exploration explored 100000 steps with 684 reset in 783 ms.
Built C files in :
/tmp/ltsmin17487443912334669533
[2022-05-15 02:57:45] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-15 02:57:45] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17487443912334669533
Running compilation step : cd /tmp/ltsmin17487443912334669533;'/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/ltsmin17487443912334669533;'/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/ltsmin17487443912334669533;'/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 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 251 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:57:49] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:57:49] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 02:57:49] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
[2022-05-15 02:57:49] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:57:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:50] [INFO ] Implicit Places using invariants in 290 ms returned []
[2022-05-15 02:57:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:57:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:57:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:57:50] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2022-05-15 02:57:50] [INFO ] Redundant transitions in 50 ms returned []
[2022-05-15 02:57:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:57:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:57:51] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin12257262150662131203
[2022-05-15 02:57:51] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-15 02:57:51] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12257262150662131203
Running compilation step : cd /tmp/ltsmin12257262150662131203;'/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/ltsmin12257262150662131203;'/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/ltsmin12257262150662131203;'/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-15 02:57:54] [INFO ] Flatten gal took : 65 ms
[2022-05-15 02:57:54] [INFO ] Flatten gal took : 66 ms
[2022-05-15 02:57:54] [INFO ] Time to serialize gal into /tmp/LTL14227335073932924725.gal : 8 ms
[2022-05-15 02:57:54] [INFO ] Time to serialize properties into /tmp/LTL955573960039541111.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/LTL14227335073932924725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL955573960039541111.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/LTL1422733...266
Read 1 LTL properties
Checking formula 0 : !((X(F(("(SUR_PONT_A>=1)")U(X(!(F("(SUR_PONT_A>=1)"))))))))
Formula 0 simplified : !XF("(SUR_PONT_A>=1)" U X!F"(SUR_PONT_A>=1)")
Detected timeout of ITS tools.
[2022-05-15 02:58:09] [INFO ] Flatten gal took : 75 ms
[2022-05-15 02:58:09] [INFO ] Applying decomposition
[2022-05-15 02:58:10] [INFO ] Flatten gal took : 67 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/graph7633686195457735554.txt' '-o' '/tmp/graph7633686195457735554.bin' '-w' '/tmp/graph7633686195457735554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7633686195457735554.bin' '-l' '-1' '-v' '-w' '/tmp/graph7633686195457735554.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:58:10] [INFO ] Decomposing Gal with order
[2022-05-15 02:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:58:10] [INFO ] Removed a total of 4214 redundant transitions.
[2022-05-15 02:58:10] [INFO ] Flatten gal took : 496 ms
[2022-05-15 02:58:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 14 ms.
[2022-05-15 02:58:10] [INFO ] Time to serialize gal into /tmp/LTL2761002004872200306.gal : 1 ms
[2022-05-15 02:58:10] [INFO ] Time to serialize properties into /tmp/LTL11797490178099107336.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/LTL2761002004872200306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11797490178099107336.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/LTL2761002...246
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i0.u1.SUR_PONT_A>=1)")U(X(!(F("(i0.u1.SUR_PONT_A>=1)"))))))))
Formula 0 simplified : !XF("(i0.u1.SUR_PONT_A>=1)" U X!F"(i0.u1.SUR_PONT_A>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1060679021649447831
[2022-05-15 02:58:25] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1060679021649447831
Running compilation step : cd /tmp/ltsmin1060679021649447831;'/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/ltsmin1060679021649447831;'/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/ltsmin1060679021649447831;'/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-PT-V20P10N50-LTLFireability-15 finished in 51660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(F(p0) U (!X(p1)||(X(G(p3))&&p2))))))'
Found a CL insensitive property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-08
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (AND p0 p2 p3) (AND p0 (NOT p1))), (NOT p1), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1) p3) (AND p0 p2 p3)), (AND (NOT p1) p3), (AND p0 (NOT p1) p3)]
Support contains 9 out of 106 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 35 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:58:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:31] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
[2022-05-15 02:58:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:32] [INFO ] Implicit Places using invariants in 237 ms returned []
[2022-05-15 02:58:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:32] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2022-05-15 02:58:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:33] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 105/106 places, 2227/2228 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/106 places, 2227/2228 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={0, 1} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={1} source=2 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) p3), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2) p3), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p2 p3), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p2 p3), acceptance={1} source=6 dest: 6}, { cond=(AND p0 (NOT p2) p3), acceptance={0, 1} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={1} source=6 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p1) p3), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0} source=8 dest: 4}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1) p3), acceptance={1} source=8 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0, 1} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={1} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)), p2:(AND (GEQ s4 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)), p1:(AND (GEQ s24 1) (GEQ s26 1) (GEQ s33...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1404 reset in 751 ms.
Product exploration explored 100000 steps with 1408 reset in 840 ms.
Computed a total of 48 stabilizing places and 83 stable transitions
Computed a total of 48 stabilizing places and 83 stable transitions
Detected a total of 48/105 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p3)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 2872 ms. Reduced automaton from 9 states, 41 edges and 4 AP to 9 states, 41 edges and 4 AP.
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (OR (AND p0 p2 p3) (AND p0 (NOT p1))), (NOT p1), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1) p3) (AND p0 p2 p3)), (AND (NOT p1) p3), (AND p0 (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 22) seen :12
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-05-15 02:58:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:39] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:58:39] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:58:39] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 10 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p3)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p0 p3 (NOT p2)))), (G (NOT (AND p3 p2))), (G (NOT (AND (NOT p0) p3 p2))), (G (NOT (AND p0 p3 p2))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p0) p2 (NOT p1)))), (G (NOT (AND p3 p2 (NOT p1)))), (G (NOT (AND p0 p3 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) p3 p2 (NOT p1)))), (G (NOT (AND p0 p3 p2 (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND p0 (NOT p1))), (F p1), (F (AND p0 p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p3 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) p3 (NOT p2) (NOT p1))), (F (AND p0 p2)), (F p2), (F (AND p3 (NOT p2))), (F (AND (NOT p0) p3 (NOT p2)))]
Knowledge based reduction with 27 factoid took 3433 ms. Reduced automaton from 9 states, 41 edges and 4 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
[2022-05-15 02:58:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 02:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:58:43] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-15 02:58:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:58:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:58:44] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-15 02:58:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:58:44] [INFO ] [Nat]Added 102 Read/Feed constraints in 27 ms returned sat
[2022-05-15 02:58:44] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 225 ms.
[2022-05-15 02:58:44] [INFO ] Added : 55 causal constraints over 12 iterations in 489 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2227/2227 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:58:44] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:45] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2022-05-15 02:58:45] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:45] [INFO ] Implicit Places using invariants in 235 ms returned []
[2022-05-15 02:58:45] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:45] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2022-05-15 02:58:45] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:58:46] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 2227/2227 transitions.
Computed a total of 48 stabilizing places and 83 stable transitions
Computed a total of 48 stabilizing places and 83 stable transitions
Detected a total of 48/105 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 481 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
Finished random walk after 166 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p3))), (F (AND p0 (NOT p3) (NOT p1))), (F p0)]
Knowledge based reduction with 10 factoid took 579 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
[2022-05-15 02:58:48] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:48] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 02:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:58:48] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-15 02:58:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:58:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:58:49] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-15 02:58:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:58:49] [INFO ] [Nat]Added 102 Read/Feed constraints in 26 ms returned sat
[2022-05-15 02:58:49] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 63 ms.
[2022-05-15 02:58:49] [INFO ] Added : 55 causal constraints over 12 iterations in 324 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p3) (NOT p1))]
Stuttering criterion allowed to conclude after 40197 steps with 308 reset in 308 ms.
Treatment of property BridgeAndVehicles-PT-V20P10N50-LTLFireability-08 finished in 21086 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X((!(!F(p1) U p1)&&p0)) U p2))'
Found a CL insensitive property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-09
Stuttering acceptance computed with spot in 67 ms :[true, p2, (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 27 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 02:58:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:58:50] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
[2022-05-15 02:58:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:58:51] [INFO ] Implicit Places using invariants in 239 ms returned []
[2022-05-15 02:58:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 02:58:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:51] [INFO ] Implicit Places using invariants and state equation in 638 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 881 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 18 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 2227/2228 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p1 p2) (AND (NOT p0) p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (GEQ s47 1) (GEQ s102 1)), p1:(AND (GEQ s23 10) (GEQ s49 1)), p0:(AND (GEQ s1 1) (GEQ s24 1) (GEQ s40 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 602 reset in 738 ms.
Product exploration explored 100000 steps with 602 reset in 745 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273554 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273554 steps, saw 71539 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 02:58:56] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:58:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:56] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:58:56] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:58:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:58:57] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:58:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:58:57] [INFO ] After 231ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:58:57] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 196 ms.
[2022-05-15 02:58:57] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 88 ms.
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 156 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:58:58] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:58:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:58:58] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 255154 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255154 steps, saw 67182 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 02:59:01] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:59:01] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:59:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:59:02] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:59:02] [INFO ] After 235ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:02] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 202 ms.
[2022-05-15 02:59:02] [INFO ] After 883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 102 ms.
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 155 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 202 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:59:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:59:03] [INFO ] Implicit Places using invariants in 237 ms returned []
[2022-05-15 02:59:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:59:04] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2022-05-15 02:59:04] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-15 02:59:04] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:59:05] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 102 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1942 place count 102 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 8 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 100 cols
[2022-05-15 02:59:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:59:05] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:59:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:59:05] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 02:59:05] [INFO ] After 87ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:05] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-05-15 02:59:05] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:05] [INFO ] Flatten gal took : 10 ms
[2022-05-15 02:59:05] [INFO ] Flatten gal took : 11 ms
[2022-05-15 02:59:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality784816600974232611.gal : 3 ms
[2022-05-15 02:59:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4479539432587421556.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6776738109342173577;'/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/ReachabilityCardinality784816600974232611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4479539432587421556.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...318
Loading property file /tmp/ReachabilityCardinality4479539432587421556.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :19 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 59
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :59 after 89
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :89 after 149
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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,253,0.109116,7492,2,257,13,6449,6,0,693,4990,0
Total reachable state count : 253

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.110467,7492,2,101,13,6449,7,0,711,4990,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.111391,7744,2,101,13,6449,8,0,718,4990,0
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 76 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 72 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:59:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:59:06] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
[2022-05-15 02:59:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:59:07] [INFO ] Implicit Places using invariants in 235 ms returned []
[2022-05-15 02:59:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:59:07] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2022-05-15 02:59:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:08] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 p2) (AND p2 (NOT p0))))), true, (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 p2) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 254795 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254795 steps, saw 67091 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 02:59:12] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:59:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:59:12] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:59:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:59:12] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:59:12] [INFO ] After 231ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:12] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 198 ms.
[2022-05-15 02:59:13] [INFO ] After 874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 97 ms.
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 172 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:59:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:59:13] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 254379 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254379 steps, saw 66972 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 02:59:17] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:59:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:59:17] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:59:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:59:17] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:59:17] [INFO ] After 238ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:17] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 202 ms.
[2022-05-15 02:59:18] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 98 ms.
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 156 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 155 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:59:18] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:59:18] [INFO ] Implicit Places using invariants in 242 ms returned []
[2022-05-15 02:59:18] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:59:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:59:19] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2022-05-15 02:59:19] [INFO ] Redundant transitions in 52 ms returned []
[2022-05-15 02:59:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:59:20] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 102 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1942 place count 102 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 9 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 100 cols
[2022-05-15 02:59:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:59:20] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 02:59:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:59:20] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 02:59:20] [INFO ] After 88ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:20] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-05-15 02:59:20] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 02:59:20] [INFO ] Flatten gal took : 11 ms
[2022-05-15 02:59:20] [INFO ] Flatten gal took : 8 ms
[2022-05-15 02:59:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7749696293248507212.gal : 1 ms
[2022-05-15 02:59:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3680387175792217244.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2354806386909590645;'/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/ReachabilityCardinality7749696293248507212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3680387175792217244.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/ReachabilityCardinality3680387175792217244.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :19 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 59
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :59 after 89
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :89 after 149
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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,253,0.115772,7492,2,257,13,6772,6,0,693,4983,0
Total reachable state count : 253

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.117065,7492,2,101,13,6772,7,0,711,4983,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.118005,7756,2,101,13,6772,8,0,718,4983,0
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 p2) (AND p2 (NOT p0))))), true, (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 p2) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 87 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 108 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 602 reset in 785 ms.
Product exploration explored 100000 steps with 602 reset in 741 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[true, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 221 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:59:23] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:23] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 02:59:24] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
[2022-05-15 02:59:24] [INFO ] Redundant transitions in 44 ms returned []
[2022-05-15 02:59:24] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:24] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Product exploration explored 100000 steps with 602 reset in 736 ms.
Product exploration explored 100000 steps with 602 reset in 749 ms.
Built C files in :
/tmp/ltsmin2279916374601419254
[2022-05-15 02:59:26] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2279916374601419254
Running compilation step : cd /tmp/ltsmin2279916374601419254;'/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/ltsmin2279916374601419254;'/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/ltsmin2279916374601419254;'/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 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 14 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 02:59:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:30] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
[2022-05-15 02:59:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:59:30] [INFO ] Implicit Places using invariants in 221 ms returned []
[2022-05-15 02:59:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 02:59:31] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2022-05-15 02:59:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 02:59:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:59:31] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin13387340143499018160
[2022-05-15 02:59:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13387340143499018160
Running compilation step : cd /tmp/ltsmin13387340143499018160;'/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/ltsmin13387340143499018160;'/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/ltsmin13387340143499018160;'/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-15 02:59:34] [INFO ] Flatten gal took : 63 ms
[2022-05-15 02:59:35] [INFO ] Flatten gal took : 64 ms
[2022-05-15 02:59:35] [INFO ] Time to serialize gal into /tmp/LTL8907615886039018792.gal : 8 ms
[2022-05-15 02:59:35] [INFO ] Time to serialize properties into /tmp/LTL13746330408801247010.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/LTL8907615886039018792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13746330408801247010.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/LTL8907615...267
Read 1 LTL properties
Checking formula 0 : !((!((!(X((((!((!(F("((CAPACITE>=10)&&(VIDANGE_1>=1))")))U("((CAPACITE>=10)&&(VIDANGE_1>=1))")))&&("(NB_ATTENTE_A_0>=1)"))&&("((CONTRO...256
Formula 0 simplified : !X("((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_14>=1))" & "(COMPTEUR_10>=1)" & "(NB_ATTENTE_A_0>=1)" & !(!F"((CAPACITE>=10)&&(VIDANGE_1>=1))"...231
Detected timeout of ITS tools.
[2022-05-15 02:59:50] [INFO ] Flatten gal took : 63 ms
[2022-05-15 02:59:50] [INFO ] Applying decomposition
[2022-05-15 02:59:50] [INFO ] Flatten gal took : 66 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/graph16202477156766456912.txt' '-o' '/tmp/graph16202477156766456912.bin' '-w' '/tmp/graph16202477156766456912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16202477156766456912.bin' '-l' '-1' '-v' '-w' '/tmp/graph16202477156766456912.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:59:50] [INFO ] Decomposing Gal with order
[2022-05-15 02:59:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:59:50] [INFO ] Removed a total of 4215 redundant transitions.
[2022-05-15 02:59:50] [INFO ] Flatten gal took : 499 ms
[2022-05-15 02:59:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 15 ms.
[2022-05-15 02:59:50] [INFO ] Time to serialize gal into /tmp/LTL13695883791475919960.gal : 1 ms
[2022-05-15 02:59:50] [INFO ] Time to serialize properties into /tmp/LTL10609579802109338849.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/LTL13695883791475919960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10609579802109338849.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/LTL1369588...247
Read 1 LTL properties
Checking formula 0 : !((!((!(X((((!((!(F("((i0.u0.CAPACITE>=10)&&(i0.u1.VIDANGE_1>=1))")))U("((i0.u0.CAPACITE>=10)&&(i0.u1.VIDANGE_1>=1))")))&&("(i1.u2.NB_...316
Formula 0 simplified : !X("((i1.u2.CONTROLEUR_1>=1)&&(i1.u2.NB_ATTENTE_B_14>=1))" & "(i1.u2.NB_ATTENTE_A_0>=1)" & "(i1.u3.COMPTEUR_10>=1)" & !(!F"((i0.u0.C...291
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7676176086001543207
[2022-05-15 03:00:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7676176086001543207
Running compilation step : cd /tmp/ltsmin7676176086001543207;'/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/ltsmin7676176086001543207;'/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/ltsmin7676176086001543207;'/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-PT-V20P10N50-LTLFireability-09 finished in 78951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(F(X(F((F(p0)||p1)))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U X(!F(p0))))))'
[2022-05-15 03:00:09] [INFO ] Flatten gal took : 88 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2081473561567520389
[2022-05-15 03:00:09] [INFO ] Too many transitions (2228) to apply POR reductions. Disabling POR matrices.
[2022-05-15 03:00:09] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2081473561567520389
Running compilation step : cd /tmp/ltsmin2081473561567520389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 03:00:09] [INFO ] Applying decomposition
[2022-05-15 03:00:09] [INFO ] Flatten gal took : 90 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/graph12194775414050223612.txt' '-o' '/tmp/graph12194775414050223612.bin' '-w' '/tmp/graph12194775414050223612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12194775414050223612.bin' '-l' '-1' '-v' '-w' '/tmp/graph12194775414050223612.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:00:09] [INFO ] Decomposing Gal with order
[2022-05-15 03:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:00:10] [INFO ] Removed a total of 4292 redundant transitions.
[2022-05-15 03:00:10] [INFO ] Flatten gal took : 754 ms
[2022-05-15 03:00:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 393 labels/synchronizations in 15 ms.
[2022-05-15 03:00:10] [INFO ] Time to serialize gal into /tmp/LTLFireability13875439116624646704.gal : 2 ms
[2022-05-15 03:00:10] [INFO ] Time to serialize properties into /tmp/LTLFireability12093276904538720222.ltl : 25 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/LTLFireability13875439116624646704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12093276904538720222.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/LTLFireabi...269
Read 5 LTL properties
Checking formula 0 : !((F("(((((((((((((i2.u3.NB_ATTENTE_A_0>=1)&&(i2.u3.CONTROLEUR_1>=1))&&((i2.u3.NB_ATTENTE_B_5>=1)&&(i1.u5.COMPTEUR_3>=1)))||(((i2.u3.N...113608
Formula 0 simplified : !F"(((((((((((((i2.u3.NB_ATTENTE_A_0>=1)&&(i2.u3.CONTROLEUR_1>=1))&&((i2.u3.NB_ATTENTE_B_5>=1)&&(i1.u5.COMPTEUR_3>=1)))||(((i2.u3.NB...113604
Compilation finished in 5528 ms.
Running link step : cd /tmp/ltsmin2081473561567520389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2081473561567520389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t42, t43, t45, t221, i0.u1.t21, i0.u1.t44, i1.t1731, Intersection with reachable at each...215
Computing Next relation with stutter on 40 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
17409 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,174.118,498104,1,0,286845,293097,5957,4.18533e+06,1563,1.02351e+06,137581
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(!((F("(((i1.u2.NB_ATTENTE_A_3>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u1.CAPACITE>=1)&&(i2.u3.CONTROLEUR_1>=1)))"))U((!(X("(((i0.u1.CA...428
Formula 1 simplified : !FX!(F"(((i1.u2.NB_ATTENTE_A_3>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u1.CAPACITE>=1)&&(i2.u3.CONTROLEUR_1>=1)))" U (!X"(((i0.u1.CAPACITE>...402
Computing Next relation with stutter on 40 deadlock states
LTSmin run took 507620 ms.
Running LTSmin : cd /tmp/ltsmin2081473561567520389;'/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(!(<>((LTLAPp1==true)) U (!X((LTLAPp2==true))||(X([]((LTLAPp4==true)))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 2870 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2081473561567520389;'/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((!(!<>((LTLAPp6==true)) U (LTLAPp6==true))&&(LTLAPp5==true))) U (LTLAPp7==true))' '--buchi-type=spotba'
LTSmin run took 332166 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2081473561567520389;'/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([](<>(X(<>((<>(!(LTLAPp6==true))||(LTLAPp8==true)))))))))' '--buchi-type=spotba'
LTSmin run took 335767 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2081473561567520389;'/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(<>(((LTLAPp9==true) U X(!<>((LTLAPp9==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 03:22:56] [INFO ] Flatten gal took : 173 ms
[2022-05-15 03:22:56] [INFO ] Time to serialize gal into /tmp/LTLFireability4483700426491520415.gal : 21 ms
[2022-05-15 03:22:56] [INFO ] Time to serialize properties into /tmp/LTLFireability1677632086507409608.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/LTLFireability4483700426491520415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1677632086507409608.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/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((X(F(("(SUR_PONT_A>=1)")U(X(!(F("(SUR_PONT_A>=1)"))))))))
Formula 0 simplified : !XF("(SUR_PONT_A>=1)" U X!F"(SUR_PONT_A>=1)")
LTSmin run took 502670 ms.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2184393 ms.

BK_STOP 1652585296340

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P10N50"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P10N50, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918200196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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