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-165251918300259.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-V50P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918300259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 16K Apr 29 23:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 29 23:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 29 23:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 503K Apr 29 23:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.9K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 173K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 509K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K May 9 07:08 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 2.0M 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-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652601310522

Running Version 202205111006
[2022-05-15 07:55:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 07:55:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 07:55:11] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2022-05-15 07:55:11] [INFO ] Transformed 138 places.
[2022-05-15 07:55:12] [INFO ] Transformed 2348 transitions.
[2022-05-15 07:55:12] [INFO ] Parsed PT model containing 138 places and 2348 transitions in 319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 59 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:55:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-15 07:55:12] [INFO ] Computed 7 place invariants in 27 ms
[2022-05-15 07:55:13] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
[2022-05-15 07:55:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-15 07:55:13] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-15 07:55:13] [INFO ] Implicit Places using invariants in 330 ms returned []
[2022-05-15 07:55:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-15 07:55:13] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-15 07:55:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:14] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2022-05-15 07:55:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-15 07:55:14] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-15 07:55:14] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 2348/2348 transitions.
Support contains 15 out of 138 places after structural reductions.
[2022-05-15 07:55:15] [INFO ] Flatten gal took : 236 ms
[2022-05-15 07:55:15] [INFO ] Flatten gal took : 164 ms
[2022-05-15 07:55:15] [INFO ] Input system was already deterministic with 2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-15 07:55:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-15 07:55:16] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-15 07:55:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 07:55:17] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2022-05-15 07:55:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 07:55:17] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2022-05-15 07:55:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:17] [INFO ] After 159ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2022-05-15 07:55:18] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 292 ms.
[2022-05-15 07:55:18] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 378 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-15 07:55:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:18] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:19] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/138 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 215942 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215942 steps, saw 57706 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-15 07:55:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:55:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 07:55:23] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 07:55:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 07:55:23] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 07:55:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:23] [INFO ] After 209ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 07:55:23] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 174 ms.
[2022-05-15 07:55:24] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 202 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 569 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-15 07:55:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:24] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:55:25] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-05-15 07:55:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:55:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:26] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1629 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 177 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/135 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10002 steps, including 8 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 220597 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220597 steps, saw 58904 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-15 07:55:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-15 07:55:30] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:30] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 07:55:30] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 07:55:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 07:55:30] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 07:55:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:30] [INFO ] After 172ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 07:55:30] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2022-05-15 07:55:31] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 185 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 186 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-15 07:55:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-15 07:55:31] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:55:31] [INFO ] Implicit Places using invariants in 333 ms returned []
[2022-05-15 07:55:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-15 07:55:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:32] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2022-05-15 07:55:32] [INFO ] Redundant transitions in 129 ms returned []
[2022-05-15 07:55:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-15 07:55:32] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 07:55:33] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2060 place count 133 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2062 place count 131 transition count 287
Applied a total of 2062 rules in 15 ms. Remains 131 /133 variables (removed 2) and now considering 287/2347 (removed 2060) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 287 rows 131 cols
[2022-05-15 07:55:33] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:55:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 07:55:33] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 07:55:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 07:55:33] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 07:55:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 07:55:33] [INFO ] After 89ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 07:55:33] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-05-15 07:55:33] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-15 07:55:33] [INFO ] Flatten gal took : 16 ms
[2022-05-15 07:55:33] [INFO ] Flatten gal took : 16 ms
[2022-05-15 07:55:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12065375009849657125.gal : 7 ms
[2022-05-15 07:55:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6897104598678943457.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6964849575129759791;'/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/ReachabilityCardinality12065375009849657125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6897104598678943457.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/ReachabilityCardinality6897104598678943457.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 15
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :15 after 29
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :29 after 55
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :55 after 105
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :105 after 369
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :369 after 4340
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :4340 after 45136
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :45136 after 406224
Reachability property AtomicPropp7 is true.
Reachability property AtomicPropp2 is true.
Reachability property AtomicPropp0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.69614e+06,0.650378,21972,2,8195,17,69758,6,0,818,28910,0
Total reachable state count : 5696144

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,372,0.651426,21972,2,277,17,69758,7,0,821,28910,0
Reachability property AtomicPropp2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp2,5,0.656934,21972,2,136,17,69758,8,0,971,28910,0
Reachability property AtomicPropp7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,868,0.657261,21972,2,301,17,69758,9,0,973,28910,0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&(G(p1)||G(!p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 24 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-15 07:55:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:35] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:55:35] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
[2022-05-15 07:55:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:55:35] [INFO ] Implicit Places using invariants in 318 ms returned []
[2022-05-15 07:55:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:35] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:37] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1472 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT 2 s107), p0:(GT 1 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01 finished in 2474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(F(p1))))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 706 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-15 07:55:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:38] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:55:38] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
[2022-05-15 07:55:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:55:39] [INFO ] Implicit Places using invariants in 345 ms returned []
[2022-05-15 07:55:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:39] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:55:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:40] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1628 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 285 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s53 (ADD s109 s110))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 412 steps with 0 reset in 12 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 finished in 3439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(X(X(p0))) U p1)&&X(p0)))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 14 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:55:40] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:55:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:41] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2022-05-15 07:55:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:55:41] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:55:41] [INFO ] Implicit Places using invariants in 357 ms returned []
[2022-05-15 07:55:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:55:41] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 07:55:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:42] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
[2022-05-15 07:55:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:55:42] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:43] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s53 s108), p0:(LEQ s52 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 940 ms.
Product exploration explored 100000 steps with 33333 reset in 866 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 361 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 finished in 5014 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 28 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-15 07:55:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:55:46] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
[2022-05-15 07:55:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:46] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 07:55:46] [INFO ] Implicit Places using invariants in 339 ms returned []
[2022-05-15 07:55:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:55:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:47] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1419 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ s0 s53), p1:(GT 1 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38097 steps with 92 reset in 236 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 finished in 2487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(F(G(p0)))))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 189 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2022-05-15 07:55:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:48] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:49] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2022-05-15 07:55:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:49] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-15 07:55:49] [INFO ] Implicit Places using invariants in 333 ms returned []
[2022-05-15 07:55:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-15 07:55:49] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:50] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1759 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 186 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s108 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 362 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 finished in 2818 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&X(p1)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 25 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:55:51] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-15 07:55:51] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 07:55:51] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2022-05-15 07:55:51] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-15 07:55:51] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 07:55:52] [INFO ] Implicit Places using invariants in 311 ms returned []
[2022-05-15 07:55:52] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-15 07:55:52] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 07:55:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:53] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1493 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 24 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 3 s53), p1:(LEQ 1 s112)], 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-V50P50N20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 finished in 2311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(G((G(p0) U p0))))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 2347
Applied a total of 3 rules in 224 ms. Remains 136 /138 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2022-05-15 07:55:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-15 07:55:53] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 07:55:54] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
[2022-05-15 07:55:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-15 07:55:54] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 07:55:54] [INFO ] Implicit Places using invariants in 349 ms returned []
[2022-05-15 07:55:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2022-05-15 07:55:54] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 07:55:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:55:55] [INFO ] Implicit Places using invariants and state equation in 972 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1328 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 218 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s111)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 274 reset in 691 ms.
Product exploration explored 100000 steps with 274 reset in 678 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 3639 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 125 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=41 )
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 127 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2022-05-15 07:55:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:55:57] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:55:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 07:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:55:58] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2022-05-15 07:55:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:55:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 07:55:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:55:59] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-15 07:55:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:56:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 07:56:04] [INFO ] [Nat]Added 42 Read/Feed constraints in 4778 ms returned sat
[2022-05-15 07:56:04] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 91 ms.
[2022-05-15 07:56:04] [INFO ] Added : 47 causal constraints over 11 iterations in 535 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 177 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-15 07:56:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:56:05] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
[2022-05-15 07:56:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:56:05] [INFO ] Implicit Places using invariants in 311 ms returned []
[2022-05-15 07:56:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:56:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:56:06] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
[2022-05-15 07:56:06] [INFO ] Redundant transitions in 100 ms returned []
[2022-05-15 07:56:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:56:07] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 3639 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 129 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
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 155 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2022-05-15 07:56:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:07] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:56:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 07:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:56:08] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-05-15 07:56:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:56:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 07:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:56:09] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-15 07:56:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:56:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 07:56:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 3527 ms returned sat
[2022-05-15 07:56:13] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 67 ms.
[2022-05-15 07:56:13] [INFO ] Added : 59 causal constraints over 15 iterations in 469 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 274 reset in 603 ms.
Product exploration explored 100000 steps with 274 reset in 626 ms.
Built C files in :
/tmp/ltsmin3355849012457927715
[2022-05-15 07:56:14] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:56:14] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3355849012457927715
Running compilation step : cd /tmp/ltsmin3355849012457927715;'/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/ltsmin3355849012457927715;'/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/ltsmin3355849012457927715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 190 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-15 07:56:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:56:18] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
[2022-05-15 07:56:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:56:18] [INFO ] Implicit Places using invariants in 365 ms returned []
[2022-05-15 07:56:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:56:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:56:19] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2022-05-15 07:56:19] [INFO ] Redundant transitions in 57 ms returned []
[2022-05-15 07:56:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-15 07:56:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:56:20] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin17521814065507969960
[2022-05-15 07:56:20] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:56:20] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17521814065507969960
Running compilation step : cd /tmp/ltsmin17521814065507969960;'/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/ltsmin17521814065507969960;'/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/ltsmin17521814065507969960;'/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 07:56:23] [INFO ] Flatten gal took : 88 ms
[2022-05-15 07:56:23] [INFO ] Flatten gal took : 85 ms
[2022-05-15 07:56:23] [INFO ] Time to serialize gal into /tmp/LTL9646968428781415677.gal : 15 ms
[2022-05-15 07:56:23] [INFO ] Time to serialize properties into /tmp/LTL3213671354597570579.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/LTL9646968428781415677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3213671354597570579.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/LTL9646968...266
Read 1 LTL properties
Checking formula 0 : !((F((G("(ROUTE_A<=SORTI_B)"))||(F(G((G("(ROUTE_A<=SORTI_B)"))U("(ROUTE_A<=SORTI_B)")))))))
Formula 0 simplified : !F(G"(ROUTE_A<=SORTI_B)" | FG(G"(ROUTE_A<=SORTI_B)" U "(ROUTE_A<=SORTI_B)"))
Detected timeout of ITS tools.
[2022-05-15 07:56:39] [INFO ] Flatten gal took : 75 ms
[2022-05-15 07:56:39] [INFO ] Applying decomposition
[2022-05-15 07:56:39] [INFO ] Flatten gal took : 79 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/graph1186560789194969874.txt' '-o' '/tmp/graph1186560789194969874.bin' '-w' '/tmp/graph1186560789194969874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1186560789194969874.bin' '-l' '-1' '-v' '-w' '/tmp/graph1186560789194969874.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:56:39] [INFO ] Decomposing Gal with order
[2022-05-15 07:56:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:56:40] [INFO ] Removed a total of 2215 redundant transitions.
[2022-05-15 07:56:40] [INFO ] Flatten gal took : 794 ms
[2022-05-15 07:56:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 26 ms.
[2022-05-15 07:56:40] [INFO ] Time to serialize gal into /tmp/LTL1826330018340288606.gal : 11 ms
[2022-05-15 07:56:40] [INFO ] Time to serialize properties into /tmp/LTL12064341541087480285.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/LTL1826330018340288606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12064341541087480285.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/LTL1826330...267
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu2.ROUTE_A<=gu2.SORTI_B)"))||(F(G((G("(gu2.ROUTE_A<=gu2.SORTI_B)"))U("(gu2.ROUTE_A<=gu2.SORTI_B)")))))))
Formula 0 simplified : !F(G"(gu2.ROUTE_A<=gu2.SORTI_B)" | FG(G"(gu2.ROUTE_A<=gu2.SORTI_B)" U "(gu2.ROUTE_A<=gu2.SORTI_B)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13619151576845485322
[2022-05-15 07:56:55] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13619151576845485322
Running compilation step : cd /tmp/ltsmin13619151576845485322;'/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/ltsmin13619151576845485322;'/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/ltsmin13619151576845485322;'/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-V50P50N20-LTLCardinality-07 finished in 65022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))||G(p1)))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 12 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:56:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-15 07:56:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 07:56:59] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
[2022-05-15 07:56:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-15 07:56:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 07:56:59] [INFO ] Implicit Places using invariants in 342 ms returned []
[2022-05-15 07:56:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2022-05-15 07:56:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 07:56:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:57:00] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1429 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ s52 s113), p0:(GT s112 s111)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 157 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 finished in 2298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((X(p0)&&p0)||p0))||F(p1)))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:57:00] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-15 07:57:00] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-15 07:57:01] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2022-05-15 07:57:01] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-15 07:57:01] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-15 07:57:01] [INFO ] Implicit Places using invariants in 320 ms returned []
[2022-05-15 07:57:01] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-15 07:57:01] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 07:57:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:57:02] [INFO ] Implicit Places using invariants and state equation in 902 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1229 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (GT 3 s111) (GT 1 s53)) (GT s113 s134)), p0:(GT s113 s134)], 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]]
Product exploration explored 100000 steps with 876 reset in 492 ms.
Product exploration explored 100000 steps with 846 reset in 487 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3642 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Finished random walk after 167 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2022-05-15 07:57:04] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:57:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 07:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:57:04] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-05-15 07:57:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:57:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 07:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:57:05] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2022-05-15 07:57:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:57:05] [INFO ] [Nat]Added 42 Read/Feed constraints in 186 ms returned sat
[2022-05-15 07:57:05] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2022-05-15 07:57:06] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2022-05-15 07:57:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1106 ms
[2022-05-15 07:57:06] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 72 ms.
[2022-05-15 07:57:08] [INFO ] Added : 108 causal constraints over 24 iterations in 1485 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 231 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:57:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:57:09] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
[2022-05-15 07:57:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:57:09] [INFO ] Implicit Places using invariants in 375 ms returned []
[2022-05-15 07:57:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:57:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:57:10] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2022-05-15 07:57:10] [INFO ] Redundant transitions in 61 ms returned []
[2022-05-15 07:57:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:10] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:57:11] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3642 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 105 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 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
[2022-05-15 07:57:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:57:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 07:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:57:12] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2022-05-15 07:57:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:57:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 07:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:57:12] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-05-15 07:57:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:57:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 187 ms returned sat
[2022-05-15 07:57:13] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2022-05-15 07:57:13] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2022-05-15 07:57:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1101 ms
[2022-05-15 07:57:14] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 59 ms.
[2022-05-15 07:57:15] [INFO ] Added : 108 causal constraints over 24 iterations in 1403 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 883 reset in 496 ms.
Product exploration explored 100000 steps with 869 reset in 484 ms.
Built C files in :
/tmp/ltsmin7948770543218534865
[2022-05-15 07:57:16] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:57:16] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7948770543218534865
Running compilation step : cd /tmp/ltsmin7948770543218534865;'/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/ltsmin7948770543218534865;'/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/ltsmin7948770543218534865;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 247 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:57:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:57:20] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
[2022-05-15 07:57:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:57:20] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-05-15 07:57:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:57:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:57:21] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2022-05-15 07:57:21] [INFO ] Redundant transitions in 59 ms returned []
[2022-05-15 07:57:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:21] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:57:22] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin2514777891474020612
[2022-05-15 07:57:22] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:57:22] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2514777891474020612
Running compilation step : cd /tmp/ltsmin2514777891474020612;'/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/ltsmin2514777891474020612;'/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/ltsmin2514777891474020612;'/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 07:57:25] [INFO ] Flatten gal took : 76 ms
[2022-05-15 07:57:25] [INFO ] Flatten gal took : 76 ms
[2022-05-15 07:57:25] [INFO ] Time to serialize gal into /tmp/LTL16979314386811005681.gal : 14 ms
[2022-05-15 07:57:25] [INFO ] Time to serialize properties into /tmp/LTL4518367185510269312.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/LTL16979314386811005681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4518367185510269312.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/LTL1697931...267
Read 1 LTL properties
Checking formula 0 : !(((X(((X("(SORTI_B>COMPTEUR_19)"))&&("(SORTI_B>COMPTEUR_19)"))||("(SORTI_B>COMPTEUR_19)")))||(F("(((VIDANGE_1<3)||(SORTI_A<1))&&(SORT...177
Formula 0 simplified : !(X("(SORTI_B>COMPTEUR_19)" | ("(SORTI_B>COMPTEUR_19)" & X"(SORTI_B>COMPTEUR_19)")) | F"(((VIDANGE_1<3)||(SORTI_A<1))&&(SORTI_B>COMP...166
Detected timeout of ITS tools.
[2022-05-15 07:57:40] [INFO ] Flatten gal took : 73 ms
[2022-05-15 07:57:40] [INFO ] Applying decomposition
[2022-05-15 07:57:40] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4955301796345384521.txt' '-o' '/tmp/graph4955301796345384521.bin' '-w' '/tmp/graph4955301796345384521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4955301796345384521.bin' '-l' '-1' '-v' '-w' '/tmp/graph4955301796345384521.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:57:40] [INFO ] Decomposing Gal with order
[2022-05-15 07:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:57:41] [INFO ] Removed a total of 2346 redundant transitions.
[2022-05-15 07:57:41] [INFO ] Flatten gal took : 492 ms
[2022-05-15 07:57:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 337 labels/synchronizations in 19 ms.
[2022-05-15 07:57:41] [INFO ] Time to serialize gal into /tmp/LTL16387050420999387334.gal : 6 ms
[2022-05-15 07:57:41] [INFO ] Time to serialize properties into /tmp/LTL1759264437609850485.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/LTL16387050420999387334.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1759264437609850485.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/LTL1638705...267
Read 1 LTL properties
Checking formula 0 : !(((X(((X("(gu3.SORTI_B>gu3.COMPTEUR_19)"))&&("(gu3.SORTI_B>gu3.COMPTEUR_19)"))||("(gu3.SORTI_B>gu3.COMPTEUR_19)")))||(F("(((gi0.gu1.V...225
Formula 0 simplified : !(X("(gu3.SORTI_B>gu3.COMPTEUR_19)" | ("(gu3.SORTI_B>gu3.COMPTEUR_19)" & X"(gu3.SORTI_B>gu3.COMPTEUR_19)")) | F"(((gi0.gu1.VIDANGE_1...214
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6486476309390870052
[2022-05-15 07:57:56] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6486476309390870052
Running compilation step : cd /tmp/ltsmin6486476309390870052;'/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/ltsmin6486476309390870052;'/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/ltsmin6486476309390870052;'/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-V50P50N20-LTLCardinality-10 finished in 58751 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 17 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:57:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:57:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:58:00] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
[2022-05-15 07:58:00] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:58:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:00] [INFO ] Implicit Places using invariants in 315 ms returned []
[2022-05-15 07:58:00] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:58:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:58:01] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1499 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 16 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 s52), p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 415 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 finished in 2470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0))||p1))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 229 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:58:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:58:02] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:58:02] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2022-05-15 07:58:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:58:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:03] [INFO ] Implicit Places using invariants in 353 ms returned []
[2022-05-15 07:58:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-15 07:58:03] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 07:58:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:58:04] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1479 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 244 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s110), p0:(AND (LEQ s107 s116) (LEQ s111 s53))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 291 reset in 607 ms.
Product exploration explored 100000 steps with 304 reset in 629 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 109 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 217 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:58:06] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2022-05-15 07:58:06] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 07:58:07] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
[2022-05-15 07:58:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2022-05-15 07:58:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:07] [INFO ] Implicit Places using invariants in 309 ms returned []
[2022-05-15 07:58:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2022-05-15 07:58:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:58:09] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
[2022-05-15 07:58:09] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-15 07:58:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2022-05-15 07:58:09] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-15 07:58:09] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2348/2348 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 168 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 291 reset in 626 ms.
Product exploration explored 100000 steps with 305 reset in 669 ms.
Built C files in :
/tmp/ltsmin5509769065426465196
[2022-05-15 07:58:11] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:58:11] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5509769065426465196
Running compilation step : cd /tmp/ltsmin5509769065426465196;'/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/ltsmin5509769065426465196;'/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/ltsmin5509769065426465196;'/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 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 234 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-15 07:58:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2022-05-15 07:58:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:15] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
[2022-05-15 07:58:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2022-05-15 07:58:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:15] [INFO ] Implicit Places using invariants in 296 ms returned []
[2022-05-15 07:58:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2022-05-15 07:58:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 07:58:17] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2022-05-15 07:58:17] [INFO ] Redundant transitions in 57 ms returned []
[2022-05-15 07:58:17] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2022-05-15 07:58:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 07:58:18] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin6855328635881539482
[2022-05-15 07:58:18] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:58:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6855328635881539482
Running compilation step : cd /tmp/ltsmin6855328635881539482;'/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/ltsmin6855328635881539482;'/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/ltsmin6855328635881539482;'/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 07:58:21] [INFO ] Flatten gal took : 98 ms
[2022-05-15 07:58:21] [INFO ] Flatten gal took : 66 ms
[2022-05-15 07:58:21] [INFO ] Time to serialize gal into /tmp/LTL15226853973295118952.gal : 10 ms
[2022-05-15 07:58:21] [INFO ] Time to serialize properties into /tmp/LTL7804972422200255318.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/LTL15226853973295118952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7804972422200255318.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/LTL1522685...267
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("((ATTENTE_B<=COMPTEUR_2)&&(VIDANGE_1<=CAPACITE))")))||("(SUR_PONT_B>=1)")))))
Formula 0 simplified : !FG("(SUR_PONT_B>=1)" | XF"((ATTENTE_B<=COMPTEUR_2)&&(VIDANGE_1<=CAPACITE))")
Detected timeout of ITS tools.
[2022-05-15 07:58:36] [INFO ] Flatten gal took : 68 ms
[2022-05-15 07:58:36] [INFO ] Applying decomposition
[2022-05-15 07:58:36] [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/graph14140368538114773268.txt' '-o' '/tmp/graph14140368538114773268.bin' '-w' '/tmp/graph14140368538114773268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14140368538114773268.bin' '-l' '-1' '-v' '-w' '/tmp/graph14140368538114773268.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:58:36] [INFO ] Decomposing Gal with order
[2022-05-15 07:58:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:58:38] [INFO ] Removed a total of 3496 redundant transitions.
[2022-05-15 07:58:38] [INFO ] Flatten gal took : 1226 ms
[2022-05-15 07:58:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2537 labels/synchronizations in 97 ms.
[2022-05-15 07:58:38] [INFO ] Time to serialize gal into /tmp/LTL8030391224779768176.gal : 6 ms
[2022-05-15 07:58:38] [INFO ] Time to serialize properties into /tmp/LTL14103726413218058779.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/LTL8030391224779768176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14103726413218058779.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/LTL8030391...267
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("((gu1.ATTENTE_B<=gu1.COMPTEUR_2)&&(gu2.VIDANGE_1<=gu2.CAPACITE))")))||("(gi2.gu0.SUR_PONT_B>=1)")))))
Formula 0 simplified : !FG("(gi2.gu0.SUR_PONT_B>=1)" | XF"((gu1.ATTENTE_B<=gu1.COMPTEUR_2)&&(gu2.VIDANGE_1<=gu2.CAPACITE))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12026313797887010193
[2022-05-15 07:58:53] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12026313797887010193
Running compilation step : cd /tmp/ltsmin12026313797887010193;'/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/ltsmin12026313797887010193;'/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/ltsmin12026313797887010193;'/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-V50P50N20-LTLCardinality-13 finished in 54471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(G((G(p0) U p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((X(p0)&&p0)||p0))||F(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0))||p1))))'
[2022-05-15 07:58:56] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4083198870683830680
[2022-05-15 07:58:56] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2022-05-15 07:58:56] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4083198870683830680
Running compilation step : cd /tmp/ltsmin4083198870683830680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 07:58:57] [INFO ] Applying decomposition
[2022-05-15 07:58:57] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8940148964517501228.txt' '-o' '/tmp/graph8940148964517501228.bin' '-w' '/tmp/graph8940148964517501228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8940148964517501228.bin' '-l' '-1' '-v' '-w' '/tmp/graph8940148964517501228.weights' '-q' '0' '-e' '0.001'
[2022-05-15 07:58:57] [INFO ] Decomposing Gal with order
[2022-05-15 07:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 07:58:58] [INFO ] Removed a total of 1601 redundant transitions.
[2022-05-15 07:58:58] [INFO ] Flatten gal took : 1093 ms
[2022-05-15 07:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1514 labels/synchronizations in 30 ms.
[2022-05-15 07:58:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality9631290049970550904.gal : 10 ms
[2022-05-15 07:58:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality9988156952593682057.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/LTLCardinality9631290049970550904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9988156952593682057.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 3 LTL properties
Checking formula 0 : !((F((G("(gu3.ROUTE_A<=gu3.SORTI_B)"))||(F(G((G("(gu3.ROUTE_A<=gu3.SORTI_B)"))U("(gu3.ROUTE_A<=gu3.SORTI_B)")))))))
Formula 0 simplified : !F(G"(gu3.ROUTE_A<=gu3.SORTI_B)" | FG(G"(gu3.ROUTE_A<=gu3.SORTI_B)" U "(gu3.ROUTE_A<=gu3.SORTI_B)"))
Compilation finished in 5618 ms.
Running link step : cd /tmp/ltsmin4083198870683830680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin4083198870683830680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||<>([](([]((LTLAPp0==true)) U (LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin4083198870683830680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||<>([](([]((LTLAPp0==true)) U (LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4083198870683830680;'/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((LTLAPp1==true))&&(LTLAPp1==true))||(LTLAPp1==true)))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 08:20:15] [INFO ] Flatten gal took : 224 ms
[2022-05-15 08:20:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality2499414131892935078.gal : 26 ms
[2022-05-15 08:20:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality1304773454253078952.ltl : 654 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/LTLCardinality2499414131892935078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1304773454253078952.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 3 LTL properties
Checking formula 0 : !((F((G("(ROUTE_A<=SORTI_B)"))||(F(G((G("(ROUTE_A<=SORTI_B)"))U("(ROUTE_A<=SORTI_B)")))))))
Formula 0 simplified : !F(G"(ROUTE_A<=SORTI_B)" | FG(G"(ROUTE_A<=SORTI_B)" U "(ROUTE_A<=SORTI_B)"))
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin4083198870683830680;'/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((LTLAPp1==true))&&(LTLAPp1==true))||(LTLAPp1==true)))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4083198870683830680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp3==true)))||(LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 08:41:32] [INFO ] Flatten gal took : 178 ms
[2022-05-15 08:41:32] [INFO ] Input system was already deterministic with 2348 transitions.
[2022-05-15 08:41:32] [INFO ] Transformed 138 places.
[2022-05-15 08:41:32] [INFO ] Transformed 2348 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 08:41:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality1723909194709426619.gal : 13 ms
[2022-05-15 08:41:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality3144950505692602791.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/LTLCardinality1723909194709426619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3144950505692602791.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(ROUTE_A<=SORTI_B)"))||(F(G((G("(ROUTE_A<=SORTI_B)"))U("(ROUTE_A<=SORTI_B)")))))))
Formula 0 simplified : !F(G"(ROUTE_A<=SORTI_B)" | FG(G"(ROUTE_A<=SORTI_B)" U "(ROUTE_A<=SORTI_B)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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