About the Execution of ITS-Tools for BridgeAndVehicles-PT-V50P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15641.915 | 3600000.00 | 13667004.00 | 4600.20 | T?FFFFF?FFFFTF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918200227.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-V50P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200227
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 22K Apr 29 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 29 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 162K Apr 29 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 623K Apr 29 23:07 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 11K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 86K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 260K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.1M 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-V50P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652590425190
Running Version 202205111006
[2022-05-15 04:53:46] [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 04:53:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 04:53:46] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2022-05-15 04:53:46] [INFO ] Transformed 128 places.
[2022-05-15 04:53:46] [INFO ] Transformed 1328 transitions.
[2022-05-15 04:53:46] [INFO ] Parsed PT model containing 128 places and 1328 transitions in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 45 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:53:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-15 04:53:46] [INFO ] Computed 7 place invariants in 29 ms
[2022-05-15 04:53:47] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2022-05-15 04:53:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-15 04:53:47] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-15 04:53:47] [INFO ] Implicit Places using invariants in 207 ms returned []
[2022-05-15 04:53:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-15 04:53:47] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-15 04:53:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:53:48] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2022-05-15 04:53:48] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-15 04:53:48] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-15 04:53:48] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 1328/1328 transitions.
Support contains 15 out of 128 places after structural reductions.
[2022-05-15 04:53:48] [INFO ] Flatten gal took : 129 ms
[2022-05-15 04:53:48] [INFO ] Flatten gal took : 86 ms
[2022-05-15 04:53:49] [INFO ] Input system was already deterministic with 1328 transitions.
Support contains 14 out of 128 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:53:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-15 04:53:49] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-15 04:53:49] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-15 04:53:49] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:53:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2022-05-15 04:53:49] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:53:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:53:49] [INFO ] After 76ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:53:49] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-15 04:53:49] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 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 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 164 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-15 04:53:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:53:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:53:50] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/128 places, 1327/1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 449162 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 449162 steps, saw 122648 distinct states, run finished after 3002 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:53:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:53:53] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 04:53:53] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:53:53] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:53:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:53:53] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:53:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:53:53] [INFO ] After 30ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:53:53] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-15 04:53:53] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 68 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 112 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:53:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:53:54] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:53:54] [INFO ] Implicit Places using invariants in 214 ms returned []
[2022-05-15 04:53:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:53:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:53:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:53:54] [INFO ] Implicit Places using invariants and state equation in 660 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 885 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 123/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 63 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/125 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 477193 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 477193 steps, saw 130371 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:53:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:53:58] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 04:53:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:53:58] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:53:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:53:58] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:53:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:53:58] [INFO ] After 58ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:53:58] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-15 04:53:58] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 57 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:53:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:53:58] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:53:58] [INFO ] Implicit Places using invariants in 219 ms returned []
[2022-05-15 04:53:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:53:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:53:59] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2022-05-15 04:53:59] [INFO ] Redundant transitions in 91 ms returned []
[2022-05-15 04:53:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:53:59] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:53:59] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1082 place count 121 transition count 247
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1084 place count 121 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1086 place count 119 transition count 245
Applied a total of 1086 rules in 19 ms. Remains 119 /123 variables (removed 4) and now considering 245/1327 (removed 1082) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 119 cols
[2022-05-15 04:53:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:53:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:53:59] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:53:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:53:59] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:53:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 04:53:59] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:53:59] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 04:54:00] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:54:00] [INFO ] Flatten gal took : 18 ms
[2022-05-15 04:54:00] [INFO ] Flatten gal took : 14 ms
[2022-05-15 04:54:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality497370734617301607.gal : 9 ms
[2022-05-15 04:54:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15380379219697393696.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms18400192800592196357;'/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/ReachabilityCardinality497370734617301607.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15380379219697393696.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality15380379219697393696.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 168
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :168 after 840
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :840 after 5040
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5040 after 28560
Reachability property AtomicPropp2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,183750,0.179101,9556,2,1963,14,23299,6,0,728,10334,0
Total reachable state count : 183750
Verifying 1 reachability properties.
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,378,0.179687,9556,2,182,14,23299,7,0,731,10334,0
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 17 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:54:00] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:54:00] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 04:54:00] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
[2022-05-15 04:54:00] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:54:00] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 04:54:01] [INFO ] Implicit Places using invariants in 207 ms returned []
[2022-05-15 04:54:01] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:54:01] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 04:54:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:54:01] [INFO ] Implicit Places using invariants and state equation in 673 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 888 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GT s112 1), p1:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 638 ms.
Product exploration explored 100000 steps with 50000 reset in 597 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 2541 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/125 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 10 factoid took 164 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-00 finished in 3010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1327
Applied a total of 4 rules in 17 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-15 04:54:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:54:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 04:54:03] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2022-05-15 04:54:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:54:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:54:04] [INFO ] Implicit Places using invariants in 185 ms returned []
[2022-05-15 04:54:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:54:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:54:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:54:04] [INFO ] Implicit Places using invariants and state equation in 621 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 813 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 71 ms :[p1, p1]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s53), p1:(GT s0 (ADD s54 s55))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 236 reset in 468 ms.
Product exploration explored 100000 steps with 236 reset in 491 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Finished random walk after 176 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 81 ms :[p1, p1]
[2022-05-15 04:54:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:54:06] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 04:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:54:06] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-15 04:54:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:54:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 04:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:54:07] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-15 04:54:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:54:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 04:54:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 4090 ms returned sat
[2022-05-15 04:54:11] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 80 ms.
[2022-05-15 04:54:11] [INFO ] Added : 8 causal constraints over 3 iterations in 229 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 15 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:54:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:54:11] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
[2022-05-15 04:54:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:54:12] [INFO ] Implicit Places using invariants in 174 ms returned []
[2022-05-15 04:54:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:54:12] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2022-05-15 04:54:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:54:12] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[p1, p1]
Finished random walk after 156 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 449 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[p1, p1]
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
[2022-05-15 04:54:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:13] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:54:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:54:14] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2022-05-15 04:54:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:54:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:54:14] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2022-05-15 04:54:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:54:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 04:54:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 4103 ms returned sat
[2022-05-15 04:54:18] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 40 ms.
[2022-05-15 04:54:18] [INFO ] Added : 8 causal constraints over 3 iterations in 189 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 217 ms :[p1, p1]
Product exploration explored 100000 steps with 236 reset in 431 ms.
Product exploration explored 100000 steps with 236 reset in 453 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 145 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:54:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:20] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:54:20] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
[2022-05-15 04:54:20] [INFO ] Redundant transitions in 56 ms returned []
[2022-05-15 04:54:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:20] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:54:20] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Product exploration explored 100000 steps with 236 reset in 472 ms.
Product exploration explored 100000 steps with 236 reset in 458 ms.
Built C files in :
/tmp/ltsmin12933137425489340880
[2022-05-15 04:54:21] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12933137425489340880
Running compilation step : cd /tmp/ltsmin12933137425489340880;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2647 ms.
Running link step : cd /tmp/ltsmin12933137425489340880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12933137425489340880;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7231003855054340507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 19 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:54:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:36] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:54:37] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
[2022-05-15 04:54:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:54:37] [INFO ] Implicit Places using invariants in 173 ms returned []
[2022-05-15 04:54:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:54:37] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2022-05-15 04:54:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:54:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:54:38] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin801804731205869240
[2022-05-15 04:54:38] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin801804731205869240
Running compilation step : cd /tmp/ltsmin801804731205869240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2494 ms.
Running link step : cd /tmp/ltsmin801804731205869240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin801804731205869240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10011889892304244584.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 04:54:53] [INFO ] Flatten gal took : 59 ms
[2022-05-15 04:54:53] [INFO ] Flatten gal took : 56 ms
[2022-05-15 04:54:53] [INFO ] Time to serialize gal into /tmp/LTL10556417248951146948.gal : 15 ms
[2022-05-15 04:54:53] [INFO ] Time to serialize properties into /tmp/LTL14897280308225196534.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/LTL10556417248951146948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14897280308225196534.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/LTL1055641...268
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(CAPACITE>=1)")U("(ROUTE_A>(CONTROLEUR_1+CONTROLEUR_2))"))))))
Formula 0 simplified : !XF!("(CAPACITE>=1)" U "(ROUTE_A>(CONTROLEUR_1+CONTROLEUR_2))")
Detected timeout of ITS tools.
[2022-05-15 04:55:08] [INFO ] Flatten gal took : 52 ms
[2022-05-15 04:55:08] [INFO ] Applying decomposition
[2022-05-15 04:55:08] [INFO ] Flatten gal took : 50 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/graph10539131977278644769.txt' '-o' '/tmp/graph10539131977278644769.bin' '-w' '/tmp/graph10539131977278644769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10539131977278644769.bin' '-l' '-1' '-v' '-w' '/tmp/graph10539131977278644769.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:55:08] [INFO ] Decomposing Gal with order
[2022-05-15 04:55:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:55:09] [INFO ] Removed a total of 3487 redundant transitions.
[2022-05-15 04:55:09] [INFO ] Flatten gal took : 524 ms
[2022-05-15 04:55:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 535 labels/synchronizations in 34 ms.
[2022-05-15 04:55:09] [INFO ] Time to serialize gal into /tmp/LTL810988641657901998.gal : 2 ms
[2022-05-15 04:55:09] [INFO ] Time to serialize properties into /tmp/LTL4361362889854696647.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/LTL810988641657901998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4361362889854696647.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/LTL8109886...265
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(gi1.gu2.CAPACITE>=1)")U("(gu0.ROUTE_A>(gu0.CONTROLEUR_1+gu0.CONTROLEUR_2))"))))))
Formula 0 simplified : !XF!("(gi1.gu2.CAPACITE>=1)" U "(gu0.ROUTE_A>(gu0.CONTROLEUR_1+gu0.CONTROLEUR_2))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1225611251513512569
[2022-05-15 04:55:24] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1225611251513512569
Running compilation step : cd /tmp/ltsmin1225611251513512569;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2505 ms.
Running link step : cd /tmp/ltsmin1225611251513512569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1225611251513512569;'/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(<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01 finished in 96250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 8 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:55:39] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:55:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:55:40] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
[2022-05-15 04:55:40] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:55:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:55:40] [INFO ] Implicit Places using invariants in 206 ms returned []
[2022-05-15 04:55:40] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:55:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:55:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:55:40] [INFO ] Implicit Places using invariants and state equation in 624 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 840 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s109 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 198 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-02 finished in 1346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))&&p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 14 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:55:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:55:41] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 04:55:41] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
[2022-05-15 04:55:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:55:41] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 04:55:41] [INFO ] Implicit Places using invariants in 201 ms returned []
[2022-05-15 04:55:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:55:41] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 04:55:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:55:42] [INFO ] Implicit Places using invariants and state equation in 689 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 895 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s53 s0), p0:(LEQ s52 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 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-05 finished in 1421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(G(p0))))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1324
Applied a total of 10 rules in 114 ms. Remains 121 /128 variables (removed 7) and now considering 1324/1328 (removed 4) transitions.
[2022-05-15 04:55:42] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 121 cols
[2022-05-15 04:55:42] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-15 04:55:42] [INFO ] Implicit Places using invariants in 202 ms returned []
[2022-05-15 04:55:42] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 121 cols
[2022-05-15 04:55:42] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 04:55:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:55:43] [INFO ] Implicit Places using invariants and state equation in 656 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 863 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/128 places, 1324/1328 transitions.
Applied a total of 0 rules in 58 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 120/128 places, 1324/1328 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-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 s105 s0)], 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 320 reset in 521 ms.
Product exploration explored 100000 steps with 319 reset in 509 ms.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Detected a total of 105/120 stabilizing places and 202/1324 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 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)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 64 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-15 04:55:45] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-15 04:55:45] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 04:55:45] [INFO ] Implicit Places using invariants in 194 ms returned []
[2022-05-15 04:55:45] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-15 04:55:45] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 04:55:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:55:45] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2022-05-15 04:55:45] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-15 04:55:45] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-15 04:55:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 04:55:46] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 1324/1324 transitions.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Detected a total of 105/120 stabilizing places and 202/1324 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 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 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 161 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 320 reset in 487 ms.
Product exploration explored 100000 steps with 320 reset in 487 ms.
Built C files in :
/tmp/ltsmin17953307232726024259
[2022-05-15 04:55:47] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2022-05-15 04:55:47] [INFO ] Computation of Complete disable matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:55:47] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2022-05-15 04:55:47] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:55:47] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2022-05-15 04:55:48] [INFO ] Computation of Completed DNA matrix. took 93 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:55:48] [INFO ] Built C files in 463ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17953307232726024259
Running compilation step : cd /tmp/ltsmin17953307232726024259;'/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/ltsmin17953307232726024259;'/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/ltsmin17953307232726024259;'/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 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 60 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-15 04:55:51] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-15 04:55:51] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 04:55:51] [INFO ] Implicit Places using invariants in 202 ms returned []
[2022-05-15 04:55:51] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-15 04:55:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 04:55:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:55:51] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2022-05-15 04:55:51] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-15 04:55:51] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2022-05-15 04:55:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 04:55:52] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 1324/1324 transitions.
Built C files in :
/tmp/ltsmin10405654348413935187
[2022-05-15 04:55:52] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2022-05-15 04:55:52] [INFO ] Computation of Complete disable matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:55:52] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2022-05-15 04:55:52] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:55:52] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2022-05-15 04:55:52] [INFO ] Computation of Completed DNA matrix. took 98 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:55:52] [INFO ] Built C files in 474ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10405654348413935187
Running compilation step : cd /tmp/ltsmin10405654348413935187;'/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/ltsmin10405654348413935187;'/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/ltsmin10405654348413935187;'/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 04:55:55] [INFO ] Flatten gal took : 48 ms
[2022-05-15 04:55:55] [INFO ] Flatten gal took : 45 ms
[2022-05-15 04:55:55] [INFO ] Time to serialize gal into /tmp/LTL9875099311309598014.gal : 7 ms
[2022-05-15 04:55:55] [INFO ] Time to serialize properties into /tmp/LTL11902967370203593397.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/LTL9875099311309598014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11902967370203593397.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/LTL9875099...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F(G("(ATTENTE_B<=ROUTE_A)")))))))
Formula 0 simplified : !GXXFG"(ATTENTE_B<=ROUTE_A)"
Detected timeout of ITS tools.
[2022-05-15 04:56:10] [INFO ] Flatten gal took : 53 ms
[2022-05-15 04:56:10] [INFO ] Applying decomposition
[2022-05-15 04:56:10] [INFO ] Flatten gal took : 41 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/graph651653471147317410.txt' '-o' '/tmp/graph651653471147317410.bin' '-w' '/tmp/graph651653471147317410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph651653471147317410.bin' '-l' '-1' '-v' '-w' '/tmp/graph651653471147317410.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:56:11] [INFO ] Decomposing Gal with order
[2022-05-15 04:56:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:56:11] [INFO ] Removed a total of 1303 redundant transitions.
[2022-05-15 04:56:11] [INFO ] Flatten gal took : 202 ms
[2022-05-15 04:56:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 425 labels/synchronizations in 16 ms.
[2022-05-15 04:56:11] [INFO ] Time to serialize gal into /tmp/LTL3958240017008884612.gal : 4 ms
[2022-05-15 04:56:11] [INFO ] Time to serialize properties into /tmp/LTL9436586767334600079.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/LTL3958240017008884612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9436586767334600079.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/LTL3958240...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F(G("(gu0.ATTENTE_B<=gu0.ROUTE_A)")))))))
Formula 0 simplified : !GXXFG"(gu0.ATTENTE_B<=gu0.ROUTE_A)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6237378785516651768
[2022-05-15 04:56:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6237378785516651768
Running compilation step : cd /tmp/ltsmin6237378785516651768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2557 ms.
Running link step : cd /tmp/ltsmin6237378785516651768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6237378785516651768;'/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(<>([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-07 finished in 58975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U p1)&&X(G(p0))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 6 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:56:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:56:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:56:41] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
[2022-05-15 04:56:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:56:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:56:42] [INFO ] Implicit Places using invariants in 205 ms returned []
[2022-05-15 04:56:42] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:56:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:56:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:56:42] [INFO ] Implicit Places using invariants and state equation in 621 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 830 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-08 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={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s120 s107), p0:(LEQ 2 s110)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-08 finished in 1377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(X(X(X((X(p0)||p1))))) U X(p2)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 11 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:56:42] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:56:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:43] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
[2022-05-15 04:56:43] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:56:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:43] [INFO ] Implicit Places using invariants in 205 ms returned []
[2022-05-15 04:56:43] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2022-05-15 04:56:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:56:44] [INFO ] Implicit Places using invariants and state equation in 690 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 901 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 629 ms :[p0, p2, (OR (AND p0 p2) (AND p1 p2)), (AND p0 p2), true, (OR p0 p1), p2, (OR (AND p0 p2) (AND p1 p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 0}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 5}]], initial=1, aps=[p1:(LEQ 2 s109), p0:(GT 1 s109), p2:(AND (LEQ 2 s109) (LEQ 1 s109))], 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1500 reset in 395 ms.
Product exploration explored 100000 steps with 1495 reset in 377 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), true, (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 8 states, 18 edges and 3 AP to 7 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 247 ms :[(OR p0 p1), p0, (OR (AND p0 p2) (AND p1 p2)), (AND p0 p2), (OR (AND p1 p2) (AND p0 p2)), (OR (AND p1 p2) (AND p0 p2)), (OR (AND p1 p2) (AND p0 p2))]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-15 04:56:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-15 04:56:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:47] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), true, (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p1 p0))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 13 factoid took 714 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 6 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p2), p0, (AND (NOT p0) p2 (NOT p1)), (OR p0 p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1))]
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) p2), p0, (AND (NOT p0) p2 (NOT p1)), (OR p0 p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1))]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 11 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:56:48] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-15 04:56:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:48] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2022-05-15 04:56:48] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-15 04:56:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:48] [INFO ] Implicit Places using invariants in 209 ms returned []
[2022-05-15 04:56:48] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-15 04:56:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:56:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:56:49] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2022-05-15 04:56:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-15 04:56:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:49] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1328/1328 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 435 ms. Reduced automaton from 6 states, 7 edges and 3 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[p0, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR p0 p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 114 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 229 ms :[p0, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR p0 p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 230 ms :[p0, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR p0 p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 228 ms :[p0, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR p0 p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 25000 reset in 494 ms.
Product exploration explored 100000 steps with 25000 reset in 514 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 205 ms :[p0, (AND (NOT p0) p2), (AND (NOT p0) p2), (OR p0 p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 1328
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 69 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:56:52] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-15 04:56:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:53] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
[2022-05-15 04:56:53] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-15 04:56:53] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2022-05-15 04:56:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:56:53] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1328/1328 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1328/1328 transitions.
Product exploration explored 100000 steps with 25000 reset in 564 ms.
Product exploration explored 100000 steps with 25000 reset in 505 ms.
Built C files in :
/tmp/ltsmin13700612493892302
[2022-05-15 04:56:54] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13700612493892302
Running compilation step : cd /tmp/ltsmin13700612493892302;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2675 ms.
Running link step : cd /tmp/ltsmin13700612493892302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13700612493892302;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16323018003865874131.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-12 finished in 14741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G((G(p0)||p1)))&&G(p2)&&!p0))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 74 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2022-05-15 04:56:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:56:57] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 04:56:58] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
[2022-05-15 04:56:58] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:56:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 04:56:58] [INFO ] Implicit Places using invariants in 206 ms returned []
[2022-05-15 04:56:58] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2022-05-15 04:56:58] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 04:56:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:56:59] [INFO ] Implicit Places using invariants and state equation in 777 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 986 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 77 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p2) (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(OR p0 (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s110 s52), p2:(GT 2 s53), p1:(LEQ s52 s112)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 424 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V50P20N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-13 finished in 1612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1327
Applied a total of 3 rules in 69 ms. Remains 126 /128 variables (removed 2) and now considering 1327/1328 (removed 1) transitions.
[2022-05-15 04:56:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 126 cols
[2022-05-15 04:56:59] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 04:56:59] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
[2022-05-15 04:56:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 126 cols
[2022-05-15 04:56:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 04:56:59] [INFO ] Implicit Places using invariants in 208 ms returned []
[2022-05-15 04:56:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 126 cols
[2022-05-15 04:56:59] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 04:56:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:57:00] [INFO ] Implicit Places using invariants and state equation in 673 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 886 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 62 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/128 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2265 reset in 364 ms.
Product exploration explored 100000 steps with 2205 reset in 377 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 2539 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/124 stabilizing places and 203/1327 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 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2022-05-15 04:57:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:57:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:57:02] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-05-15 04:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:57:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:57:02] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-15 04:57:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:57:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 177 ms returned sat
[2022-05-15 04:57:03] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 49 ms.
[2022-05-15 04:57:03] [INFO ] Added : 39 causal constraints over 10 iterations in 407 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 57 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:57:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:57:03] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
[2022-05-15 04:57:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:57:04] [INFO ] Implicit Places using invariants in 210 ms returned []
[2022-05-15 04:57:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:57:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:57:04] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2022-05-15 04:57:04] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-15 04:57:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:57:05] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1327/1327 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 2539 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/124 stabilizing places and 203/1327 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 701 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
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 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2022-05-15 04:57:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:57:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:57:06] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-05-15 04:57:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:57:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:57:07] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-05-15 04:57:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:57:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 177 ms returned sat
[2022-05-15 04:57:07] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 26 ms.
[2022-05-15 04:57:07] [INFO ] Added : 39 causal constraints over 10 iterations in 394 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2226 reset in 367 ms.
Product exploration explored 100000 steps with 2225 reset in 368 ms.
Built C files in :
/tmp/ltsmin8160035892850183345
[2022-05-15 04:57:08] [INFO ] Computing symmetric may disable matrix : 1327 transitions.
[2022-05-15 04:57:08] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:57:08] [INFO ] Computing symmetric may enable matrix : 1327 transitions.
[2022-05-15 04:57:08] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:57:08] [INFO ] Computing Do-Not-Accords matrix : 1327 transitions.
[2022-05-15 04:57:08] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:57:08] [INFO ] Built C files in 408ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8160035892850183345
Running compilation step : cd /tmp/ltsmin8160035892850183345;'/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/ltsmin8160035892850183345;'/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/ltsmin8160035892850183345;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 85 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:57:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:57:12] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
[2022-05-15 04:57:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:57:12] [INFO ] Implicit Places using invariants in 210 ms returned []
[2022-05-15 04:57:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:57:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:57:13] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2022-05-15 04:57:13] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-15 04:57:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2022-05-15 04:57:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:57:13] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin14849177472169211906
[2022-05-15 04:57:13] [INFO ] Computing symmetric may disable matrix : 1327 transitions.
[2022-05-15 04:57:13] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:57:13] [INFO ] Computing symmetric may enable matrix : 1327 transitions.
[2022-05-15 04:57:13] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:57:13] [INFO ] Computing Do-Not-Accords matrix : 1327 transitions.
[2022-05-15 04:57:13] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:57:13] [INFO ] Built C files in 402ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14849177472169211906
Running compilation step : cd /tmp/ltsmin14849177472169211906;'/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/ltsmin14849177472169211906;'/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/ltsmin14849177472169211906;'/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 04:57:16] [INFO ] Flatten gal took : 40 ms
[2022-05-15 04:57:17] [INFO ] Flatten gal took : 39 ms
[2022-05-15 04:57:17] [INFO ] Time to serialize gal into /tmp/LTL5279976129130176186.gal : 10 ms
[2022-05-15 04:57:17] [INFO ] Time to serialize properties into /tmp/LTL15302602495268103183.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/LTL5279976129130176186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15302602495268103183.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/LTL5279976...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(SORTI_A>=3)"))))
Formula 0 simplified : !GF"(SORTI_A>=3)"
Detected timeout of ITS tools.
[2022-05-15 04:57:32] [INFO ] Flatten gal took : 41 ms
[2022-05-15 04:57:32] [INFO ] Applying decomposition
[2022-05-15 04:57:32] [INFO ] Flatten gal took : 39 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/graph6965152563604680807.txt' '-o' '/tmp/graph6965152563604680807.bin' '-w' '/tmp/graph6965152563604680807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6965152563604680807.bin' '-l' '-1' '-v' '-w' '/tmp/graph6965152563604680807.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:57:32] [INFO ] Decomposing Gal with order
[2022-05-15 04:57:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:57:32] [INFO ] Removed a total of 2887 redundant transitions.
[2022-05-15 04:57:32] [INFO ] Flatten gal took : 176 ms
[2022-05-15 04:57:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 383 labels/synchronizations in 14 ms.
[2022-05-15 04:57:32] [INFO ] Time to serialize gal into /tmp/LTL11525017757498202951.gal : 2 ms
[2022-05-15 04:57:32] [INFO ] Time to serialize properties into /tmp/LTL3843655462908540765.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/LTL11525017757498202951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3843655462908540765.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1152501...246
Read 1 LTL properties
Checking formula 0 : !((G(F("(u1.SORTI_A>=3)"))))
Formula 0 simplified : !GF"(u1.SORTI_A>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17269127383529397318
[2022-05-15 04:57:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17269127383529397318
Running compilation step : cd /tmp/ltsmin17269127383529397318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2559 ms.
Running link step : cd /tmp/ltsmin17269127383529397318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17269127383529397318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-14 finished in 63425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U p1))))'
Found a CL insensitive property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01
Stuttering acceptance computed with spot in 89 ms :[p1, p1]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 2750 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 30 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-15 04:58:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:58:02] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:58:03] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
[2022-05-15 04:58:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:58:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:58:03] [INFO ] Implicit Places using invariants in 171 ms returned []
[2022-05-15 04:58:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-15 04:58:03] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 04:58:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:58:04] [INFO ] Implicit Places using invariants and state equation in 635 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 813 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 123/128 places, 1327/1328 transitions.
Applied a total of 0 rules in 19 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 123/128 places, 1327/1328 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s53), p1:(GT s0 (ADD s54 s55))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 236 reset in 452 ms.
Product exploration explored 100000 steps with 236 reset in 458 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[p1, p1]
Finished random walk after 197 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 650 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[p1, p1]
Stuttering acceptance computed with spot in 82 ms :[p1, p1]
[2022-05-15 04:58:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:58:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:58:06] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-05-15 04:58:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:58:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:58:06] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-15 04:58:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:58:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 04:58:12] [INFO ] [Nat]Added 22 Read/Feed constraints in 6016 ms returned unknown
Could not prove EG p1
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:58:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:58:13] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
[2022-05-15 04:58:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:58:13] [INFO ] Implicit Places using invariants in 171 ms returned []
[2022-05-15 04:58:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:58:13] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2022-05-15 04:58:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:58:14] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Finished random walk after 164 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[p1, p1]
Stuttering acceptance computed with spot in 67 ms :[p1, p1]
[2022-05-15 04:58:14] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:58:14] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 04:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:58:15] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2022-05-15 04:58:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:58:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:58:15] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-15 04:58:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 04:58:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 04:58:21] [INFO ] [Nat]Added 22 Read/Feed constraints in 6009 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 77 ms :[p1, p1]
Product exploration explored 100000 steps with 236 reset in 438 ms.
Product exploration explored 100000 steps with 236 reset in 440 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 74 ms :[p1, p1]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 82 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:58:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 04:58:23] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
[2022-05-15 04:58:23] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-15 04:58:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:58:23] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Product exploration explored 100000 steps with 236 reset in 435 ms.
Product exploration explored 100000 steps with 236 reset in 439 ms.
Built C files in :
/tmp/ltsmin1207443823380896482
[2022-05-15 04:58:24] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1207443823380896482
Running compilation step : cd /tmp/ltsmin1207443823380896482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2501 ms.
Running link step : cd /tmp/ltsmin1207443823380896482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1207443823380896482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14663097225059809148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-15 04:58:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:58:40] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
[2022-05-15 04:58:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:58:40] [INFO ] Implicit Places using invariants in 162 ms returned []
[2022-05-15 04:58:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 04:58:40] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2022-05-15 04:58:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-15 04:58:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:58:41] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin18253779944355346392
[2022-05-15 04:58:41] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18253779944355346392
Running compilation step : cd /tmp/ltsmin18253779944355346392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2517 ms.
Running link step : cd /tmp/ltsmin18253779944355346392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18253779944355346392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12745085297796196360.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 04:58:56] [INFO ] Flatten gal took : 41 ms
[2022-05-15 04:58:56] [INFO ] Flatten gal took : 39 ms
[2022-05-15 04:58:56] [INFO ] Time to serialize gal into /tmp/LTL12061704991262226393.gal : 8 ms
[2022-05-15 04:58:56] [INFO ] Time to serialize properties into /tmp/LTL14211696610212462159.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/LTL12061704991262226393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14211696610212462159.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/LTL1206170...268
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(CAPACITE>=1)")U("(ROUTE_A>(CONTROLEUR_1+CONTROLEUR_2))"))))))
Formula 0 simplified : !XF!("(CAPACITE>=1)" U "(ROUTE_A>(CONTROLEUR_1+CONTROLEUR_2))")
Detected timeout of ITS tools.
[2022-05-15 04:59:11] [INFO ] Flatten gal took : 70 ms
[2022-05-15 04:59:11] [INFO ] Applying decomposition
[2022-05-15 04:59:11] [INFO ] Flatten gal took : 38 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/graph8922368005986785552.txt' '-o' '/tmp/graph8922368005986785552.bin' '-w' '/tmp/graph8922368005986785552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8922368005986785552.bin' '-l' '-1' '-v' '-w' '/tmp/graph8922368005986785552.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:59:11] [INFO ] Decomposing Gal with order
[2022-05-15 04:59:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:59:11] [INFO ] Removed a total of 2415 redundant transitions.
[2022-05-15 04:59:12] [INFO ] Flatten gal took : 496 ms
[2022-05-15 04:59:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1556 labels/synchronizations in 28 ms.
[2022-05-15 04:59:12] [INFO ] Time to serialize gal into /tmp/LTL11903798111366326801.gal : 3 ms
[2022-05-15 04:59:12] [INFO ] Time to serialize properties into /tmp/LTL3588268903821868329.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/LTL11903798111366326801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3588268903821868329.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/LTL1190379...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(gi1.gu2.CAPACITE>=1)")U("(gu0.ROUTE_A>(gu0.CONTROLEUR_1+gu0.CONTROLEUR_2))"))))))
Formula 0 simplified : !XF!("(gi1.gu2.CAPACITE>=1)" U "(gu0.ROUTE_A>(gu0.CONTROLEUR_1+gu0.CONTROLEUR_2))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4036602629967487181
[2022-05-15 04:59:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4036602629967487181
Running compilation step : cd /tmp/ltsmin4036602629967487181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2615 ms.
Running link step : cd /tmp/ltsmin4036602629967487181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4036602629967487181;'/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(<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V50P20N10-LTLCardinality-01 finished in 99570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(G(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-15 04:59:42] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5350975995205704820
[2022-05-15 04:59:42] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2022-05-15 04:59:42] [INFO ] Applying decomposition
[2022-05-15 04:59:42] [INFO ] Computation of Complete disable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:59:42] [INFO ] Flatten gal took : 42 ms
[2022-05-15 04:59:42] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2022-05-15 04:59:42] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17796143752701687422.txt' '-o' '/tmp/graph17796143752701687422.bin' '-w' '/tmp/graph17796143752701687422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17796143752701687422.bin' '-l' '-1' '-v' '-w' '/tmp/graph17796143752701687422.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:59:42] [INFO ] Decomposing Gal with order
[2022-05-15 04:59:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:59:42] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2022-05-15 04:59:42] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 04:59:42] [INFO ] Built C files in 448ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5350975995205704820
Running compilation step : cd /tmp/ltsmin5350975995205704820;'/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 04:59:43] [INFO ] Removed a total of 2463 redundant transitions.
[2022-05-15 04:59:43] [INFO ] Flatten gal took : 512 ms
[2022-05-15 04:59:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1654 labels/synchronizations in 29 ms.
[2022-05-15 04:59:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality1261121233150437149.gal : 3 ms
[2022-05-15 04:59:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality17802764834012850384.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/LTLCardinality1261121233150437149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17802764834012850384.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 3 LTL properties
Checking formula 0 : !((X(F(!(("(gi1.gu3.CAPACITE>=1)")U("(gi0.gu0.ROUTE_A>(gi0.gu2.CONTROLEUR_1+gi0.gu2.CONTROLEUR_2))"))))))
Formula 0 simplified : !XF!("(gi1.gu3.CAPACITE>=1)" U "(gi0.gu0.ROUTE_A>(gi0.gu2.CONTROLEUR_1+gi0.gu2.CONTROLEUR_2))")
Compilation finished in 6293 ms.
Running link step : cd /tmp/ltsmin5350975995205704820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin5350975995205704820;'/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(<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin5350975995205704820;'/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(<>(!((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5350975995205704820;'/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(<>([]((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 05:21:42] [INFO ] Flatten gal took : 127 ms
[2022-05-15 05:21:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality12738534410418039307.gal : 5 ms
[2022-05-15 05:21:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality5629314911812084065.ltl : 70 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/LTLCardinality12738534410418039307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5629314911812084065.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 3 LTL properties
Checking formula 0 : !((X(F(!(("(CAPACITE>=1)")U("(ROUTE_A>(CONTROLEUR_1+CONTROLEUR_2))"))))))
Formula 0 simplified : !XF!("(CAPACITE>=1)" U "(ROUTE_A>(CONTROLEUR_1+CONTROLEUR_2))")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin5350975995205704820;'/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(<>([]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5350975995205704820;'/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' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 05:43:41] [INFO ] Flatten gal took : 177 ms
[2022-05-15 05:43:41] [INFO ] Input system was already deterministic with 1328 transitions.
[2022-05-15 05:43:41] [INFO ] Transformed 128 places.
[2022-05-15 05:43:41] [INFO ] Transformed 1328 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 05:43:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality6705171951884764118.gal : 4 ms
[2022-05-15 05:43:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality8121403480988718707.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/LTLCardinality6705171951884764118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8121403480988718707.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 : !((X(F(!(("(CAPACITE>=1)")U("(ROUTE_A>(CONTROLEUR_1+CONTROLEUR_2))"))))))
Formula 0 simplified : !XF!("(CAPACITE>=1)" U "(ROUTE_A>(CONTROLEUR_1+CONTROLEUR_2))")
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-V50P20N10"
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-V50P20N10, 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-165251918200227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;