About the Execution of ITS-Tools for PolyORBLF-PT-S06J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.936 | 3600000.00 | 9392742.00 | 122573.80 | FF?FFFFFFFFFFFFF | 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.r168-tall-165277017000692.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 PolyORBLF-PT-S06J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017000692
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 19K Apr 29 14:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 29 14:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 181K Apr 29 14:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 742K Apr 29 14:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 212K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 11M May 10 09:34 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 PolyORBLF-PT-S06J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652917115074
Running Version 202205111006
[2022-05-18 23:38:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 23:38:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 23:38:36] [INFO ] Load time of PNML (sax parser for PT used): 587 ms
[2022-05-18 23:38:36] [INFO ] Transformed 632 places.
[2022-05-18 23:38:37] [INFO ] Transformed 10500 transitions.
[2022-05-18 23:38:37] [INFO ] Parsed PT model containing 632 places and 10500 transitions in 765 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2022-05-18 23:38:37] [INFO ] Reduced 960 identical enabling conditions.
[2022-05-18 23:38:37] [INFO ] Reduced 960 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 182 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Applied a total of 6 rules in 180 ms. Remains 626 /632 variables (removed 6) and now considering 2430/2430 (removed 0) transitions.
[2022-05-18 23:38:37] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 626 cols
[2022-05-18 23:38:37] [INFO ] Computed 48 place invariants in 154 ms
[2022-05-18 23:38:39] [INFO ] Dead Transitions using invariants and state equation in 2271 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
[2022-05-18 23:38:39] [INFO ] Flow matrix only has 1476 transitions (discarded 36 similar events)
// Phase 1: matrix 1476 rows 626 cols
[2022-05-18 23:38:39] [INFO ] Computed 48 place invariants in 52 ms
[2022-05-18 23:38:40] [INFO ] Implicit Places using invariants in 450 ms returned [86, 223, 351, 428, 515, 590]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 456 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 620/632 places, 1512/2430 transitions.
Applied a total of 0 rules in 19 ms. Remains 620 /620 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 620/632 places, 1512/2430 transitions.
Support contains 182 out of 620 places after structural reductions.
[2022-05-18 23:38:40] [INFO ] Flatten gal took : 394 ms
[2022-05-18 23:38:41] [INFO ] Flatten gal took : 151 ms
[2022-05-18 23:38:41] [INFO ] Input system was already deterministic with 1512 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 903 ms. (steps per millisecond=11 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2022-05-18 23:38:42] [INFO ] Flow matrix only has 1476 transitions (discarded 36 similar events)
// Phase 1: matrix 1476 rows 620 cols
[2022-05-18 23:38:43] [INFO ] Computed 42 place invariants in 30 ms
[2022-05-18 23:38:43] [INFO ] [Real]Absence check using 18 positive place invariants in 22 ms returned sat
[2022-05-18 23:38:43] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 27 ms returned sat
[2022-05-18 23:38:43] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-18 23:38:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 29 ms returned sat
[2022-05-18 23:38:43] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 33 ms returned sat
[2022-05-18 23:38:54] [INFO ] After 10976ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 620 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 620 transition count 1464
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 572 transition count 1464
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 96 place count 572 transition count 1392
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 240 place count 500 transition count 1392
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 244 place count 496 transition count 1388
Iterating global reduction 2 with 4 rules applied. Total rules applied 248 place count 496 transition count 1388
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 392 place count 424 transition count 1316
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 409 place count 424 transition count 1299
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 426 place count 407 transition count 1299
Applied a total of 426 rules in 229 ms. Remains 407 /620 variables (removed 213) and now considering 1299/1512 (removed 213) transitions.
[2022-05-18 23:38:54] [INFO ] Flow matrix only has 1263 transitions (discarded 36 similar events)
// Phase 1: matrix 1263 rows 407 cols
[2022-05-18 23:38:54] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 23:38:55] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 407/620 places, 1299/1512 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 157563 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157563 steps, saw 58065 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 23:38:58] [INFO ] Flow matrix only has 1263 transitions (discarded 36 similar events)
// Phase 1: matrix 1263 rows 407 cols
[2022-05-18 23:38:58] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-18 23:38:58] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2022-05-18 23:38:58] [INFO ] [Real]Absence check using 19 positive and 23 generalized place invariants in 39 ms returned sat
[2022-05-18 23:39:01] [INFO ] After 2648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 23:39:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2022-05-18 23:39:01] [INFO ] [Nat]Absence check using 19 positive and 23 generalized place invariants in 16 ms returned sat
[2022-05-18 23:39:05] [INFO ] After 4430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 23:39:05] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:39:08] [INFO ] After 2094ms SMT Verify possible using 168 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 23:39:11] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 6 ms to minimize.
[2022-05-18 23:39:11] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2022-05-18 23:39:12] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2022-05-18 23:39:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1500 ms
[2022-05-18 23:39:13] [INFO ] After 7152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1013 ms.
[2022-05-18 23:39:14] [INFO ] After 12702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 407 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 407/407 places, 1299/1299 transitions.
Applied a total of 0 rules in 62 ms. Remains 407 /407 variables (removed 0) and now considering 1299/1299 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 407/407 places, 1299/1299 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 407/407 places, 1299/1299 transitions.
Applied a total of 0 rules in 47 ms. Remains 407 /407 variables (removed 0) and now considering 1299/1299 (removed 0) transitions.
[2022-05-18 23:39:14] [INFO ] Flow matrix only has 1263 transitions (discarded 36 similar events)
// Phase 1: matrix 1263 rows 407 cols
[2022-05-18 23:39:14] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 23:39:14] [INFO ] Implicit Places using invariants in 672 ms returned []
[2022-05-18 23:39:14] [INFO ] Flow matrix only has 1263 transitions (discarded 36 similar events)
// Phase 1: matrix 1263 rows 407 cols
[2022-05-18 23:39:14] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 23:39:15] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:39:31] [INFO ] Implicit Places using invariants and state equation in 17095 ms returned []
Implicit Place search using SMT with State Equation took 17770 ms to find 0 implicit places.
[2022-05-18 23:39:32] [INFO ] Redundant transitions in 80 ms returned []
[2022-05-18 23:39:32] [INFO ] Flow matrix only has 1263 transitions (discarded 36 similar events)
// Phase 1: matrix 1263 rows 407 cols
[2022-05-18 23:39:32] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 23:39:33] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 407/407 places, 1299/1299 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 407 transition count 1263
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 1 with 36 rules applied. Total rules applied 72 place count 407 transition count 1227
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 401 transition count 1287
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 401 transition count 1281
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 96 place count 395 transition count 1281
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 395 transition count 1275
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 389 transition count 1275
Applied a total of 108 rules in 197 ms. Remains 389 /407 variables (removed 18) and now considering 1275/1299 (removed 24) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1275 rows 389 cols
[2022-05-18 23:39:33] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 23:39:33] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-18 23:39:33] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 73 ms returned sat
[2022-05-18 23:39:35] [INFO ] After 1971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 23:39:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-18 23:39:35] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 24 ms returned sat
[2022-05-18 23:43:20] [INFO ] After 225015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-18 23:43:20] [INFO ] Flatten gal took : 81 ms
[2022-05-18 23:43:20] [INFO ] Flatten gal took : 126 ms
[2022-05-18 23:43:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6186503674700066265.gal : 37 ms
[2022-05-18 23:43:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14794132477857189680.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16761875120548398148;'/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/ReachabilityCardinality6186503674700066265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14794132477857189680.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14794132477857189680.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 151
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :151 after 277
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :277 after 2101
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2101 after 6411
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6411 after 43017
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :43017 after 185138
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :185138 after 2.08135e+06
Detected timeout of ITS tools.
[2022-05-18 23:43:36] [INFO ] Flatten gal took : 93 ms
[2022-05-18 23:43:36] [INFO ] Applying decomposition
[2022-05-18 23:43:36] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15945962556886482525.txt' '-o' '/tmp/graph15945962556886482525.bin' '-w' '/tmp/graph15945962556886482525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15945962556886482525.bin' '-l' '-1' '-v' '-w' '/tmp/graph15945962556886482525.weights' '-q' '0' '-e' '0.001'
[2022-05-18 23:43:36] [INFO ] Decomposing Gal with order
[2022-05-18 23:43:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 23:43:37] [INFO ] Removed a total of 1080 redundant transitions.
[2022-05-18 23:43:37] [INFO ] Flatten gal took : 791 ms
[2022-05-18 23:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 536 labels/synchronizations in 139 ms.
[2022-05-18 23:43:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17535538994089010113.gal : 29 ms
[2022-05-18 23:43:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5976484988650756597.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16761875120548398148;'/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/ReachabilityCardinality17535538994089010113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5976484988650756597.prop' '--nowitness'
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...299
Loading property file /tmp/ReachabilityCardinality5976484988650756597.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 69
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :69 after 71
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :71 after 321
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13199867418565400316
[2022-05-18 23:43:52] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13199867418565400316
Running compilation step : cd /tmp/ltsmin13199867418565400316;'/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 2537 ms.
Running link step : cd /tmp/ltsmin13199867418565400316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13199867418565400316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp23==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(p0)))))'
Support contains 12 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 620 transition count 1458
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 566 transition count 1458
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 566 transition count 1386
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 494 transition count 1386
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 256 place count 490 transition count 1382
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 490 transition count 1382
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 404 place count 418 transition count 1310
Applied a total of 404 rules in 170 ms. Remains 418 /620 variables (removed 202) and now considering 1310/1512 (removed 202) transitions.
[2022-05-18 23:44:08] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:08] [INFO ] Computed 42 place invariants in 29 ms
[2022-05-18 23:44:09] [INFO ] Dead Transitions using invariants and state equation in 1163 ms found 0 transitions.
[2022-05-18 23:44:09] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:09] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 23:44:10] [INFO ] Implicit Places using invariants in 537 ms returned []
[2022-05-18 23:44:10] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:10] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 23:44:10] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:44:14] [INFO ] Implicit Places using invariants and state equation in 4813 ms returned []
Implicit Place search using SMT with State Equation took 5378 ms to find 0 implicit places.
[2022-05-18 23:44:15] [INFO ] Redundant transitions in 74 ms returned []
[2022-05-18 23:44:15] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:15] [INFO ] Computed 42 place invariants in 33 ms
[2022-05-18 23:44:15] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/620 places, 1310/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/620 places, 1310/1512 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-02 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:(AND (OR (LT s55 1) (LT s99 1) (LT s271 1)) (OR (LT s55 1) (LT s99 1) (LT s349 1)) (OR (LT s55 1) (LT s56 1) (LT s116 1)) (OR (LT s55 1) (LT s99 1) (LT...], 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 2015 reset in 911 ms.
Product exploration explored 100000 steps with 1899 reset in 710 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 1310/1310 transitions.
Applied a total of 0 rules in 23 ms. Remains 418 /418 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2022-05-18 23:44:18] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:18] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 23:44:19] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
[2022-05-18 23:44:19] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:19] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 23:44:19] [INFO ] Implicit Places using invariants in 483 ms returned []
[2022-05-18 23:44:19] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:19] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 23:44:20] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:44:25] [INFO ] Implicit Places using invariants and state equation in 5711 ms returned []
Implicit Place search using SMT with State Equation took 6205 ms to find 0 implicit places.
[2022-05-18 23:44:25] [INFO ] Redundant transitions in 36 ms returned []
[2022-05-18 23:44:25] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:25] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 23:44:26] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 1310/1310 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 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 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 69 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=69 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1952 reset in 647 ms.
Product exploration explored 100000 steps with 2019 reset in 632 ms.
Built C files in :
/tmp/ltsmin6665111347416653173
[2022-05-18 23:44:28] [INFO ] Computing symmetric may disable matrix : 1310 transitions.
[2022-05-18 23:44:28] [INFO ] Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:44:28] [INFO ] Computing symmetric may enable matrix : 1310 transitions.
[2022-05-18 23:44:28] [INFO ] Computation of Complete enable matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:44:28] [INFO ] Computing Do-Not-Accords matrix : 1310 transitions.
[2022-05-18 23:44:28] [INFO ] Computation of Completed DNA matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:44:28] [INFO ] Built C files in 430ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6665111347416653173
Running compilation step : cd /tmp/ltsmin6665111347416653173;'/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/ltsmin6665111347416653173;'/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/ltsmin6665111347416653173;'/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 12 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 1310/1310 transitions.
Applied a total of 0 rules in 44 ms. Remains 418 /418 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2022-05-18 23:44:31] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:31] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 23:44:33] [INFO ] Dead Transitions using invariants and state equation in 1952 ms found 0 transitions.
[2022-05-18 23:44:33] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:33] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 23:44:34] [INFO ] Implicit Places using invariants in 456 ms returned []
[2022-05-18 23:44:34] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:34] [INFO ] Computed 42 place invariants in 37 ms
[2022-05-18 23:44:34] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:44:39] [INFO ] Implicit Places using invariants and state equation in 5333 ms returned []
Implicit Place search using SMT with State Equation took 5825 ms to find 0 implicit places.
[2022-05-18 23:44:39] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-18 23:44:39] [INFO ] Flow matrix only has 1274 transitions (discarded 36 similar events)
// Phase 1: matrix 1274 rows 418 cols
[2022-05-18 23:44:39] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:44:40] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 1310/1310 transitions.
Built C files in :
/tmp/ltsmin10034807507938565688
[2022-05-18 23:44:40] [INFO ] Computing symmetric may disable matrix : 1310 transitions.
[2022-05-18 23:44:40] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:44:40] [INFO ] Computing symmetric may enable matrix : 1310 transitions.
[2022-05-18 23:44:40] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:44:40] [INFO ] Computing Do-Not-Accords matrix : 1310 transitions.
[2022-05-18 23:44:40] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:44:40] [INFO ] Built C files in 258ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10034807507938565688
Running compilation step : cd /tmp/ltsmin10034807507938565688;'/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/ltsmin10034807507938565688;'/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/ltsmin10034807507938565688;'/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-18 23:44:44] [INFO ] Flatten gal took : 103 ms
[2022-05-18 23:44:44] [INFO ] Flatten gal took : 134 ms
[2022-05-18 23:44:44] [INFO ] Time to serialize gal into /tmp/LTL4848895256652285253.gal : 25 ms
[2022-05-18 23:44:44] [INFO ] Time to serialize properties into /tmp/LTL18211103626119825058.ltl : 18 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/LTL4848895256652285253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18211103626119825058.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/LTL4848895...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((((((((P_1717<1)||(P_1724_4<1))||(FetchJobB_4<1))&&(((P_1717<1)||(P_1724_4<1))||(FetchJobB_2<1)))&&((((P_1717<1)||(FetchJ...1506
Formula 0 simplified : !XFGF"((((((((P_1717<1)||(P_1724_4<1))||(FetchJobB_4<1))&&(((P_1717<1)||(P_1724_4<1))||(FetchJobB_2<1)))&&((((P_1717<1)||(FetchJobB_...1496
Detected timeout of ITS tools.
[2022-05-18 23:44:59] [INFO ] Flatten gal took : 56 ms
[2022-05-18 23:44:59] [INFO ] Applying decomposition
[2022-05-18 23:44:59] [INFO ] Flatten gal took : 56 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/graph220225549603168633.txt' '-o' '/tmp/graph220225549603168633.bin' '-w' '/tmp/graph220225549603168633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph220225549603168633.bin' '-l' '-1' '-v' '-w' '/tmp/graph220225549603168633.weights' '-q' '0' '-e' '0.001'
[2022-05-18 23:44:59] [INFO ] Decomposing Gal with order
[2022-05-18 23:44:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 23:44:59] [INFO ] Removed a total of 841 redundant transitions.
[2022-05-18 23:45:00] [INFO ] Flatten gal took : 321 ms
[2022-05-18 23:45:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 59 ms.
[2022-05-18 23:45:00] [INFO ] Time to serialize gal into /tmp/LTL756282325900887152.gal : 16 ms
[2022-05-18 23:45:00] [INFO ] Time to serialize properties into /tmp/LTL15838774346516658025.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/LTL756282325900887152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15838774346516658025.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/LTL7562823...245
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((((((((i6.u3.P_1717<1)||(i6.u13.P_1724_4<1))||(i6.u3.FetchJobB_4<1))&&(((i6.u3.P_1717<1)||(i6.u13.P_1724_4<1))||(i6.u3.Fe...2076
Formula 0 simplified : !XFGF"((((((((i6.u3.P_1717<1)||(i6.u13.P_1724_4<1))||(i6.u3.FetchJobB_4<1))&&(((i6.u3.P_1717<1)||(i6.u13.P_1724_4<1))||(i6.u3.FetchJ...2066
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13561096088960207945
[2022-05-18 23:45:15] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13561096088960207945
Running compilation step : cd /tmp/ltsmin13561096088960207945;'/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 2400 ms.
Running link step : cd /tmp/ltsmin13561096088960207945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13561096088960207945;'/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)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-02 finished in 82070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 43 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 35 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 23:45:30] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:45:30] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:45:31] [INFO ] Dead Transitions using invariants and state equation in 1517 ms found 0 transitions.
[2022-05-18 23:45:31] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:45:31] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:45:32] [INFO ] Implicit Places using invariants in 583 ms returned []
[2022-05-18 23:45:32] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:45:32] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 23:45:32] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:45:40] [INFO ] Implicit Places using invariants and state equation in 7679 ms returned []
Implicit Place search using SMT with State Equation took 8278 ms to find 0 implicit places.
[2022-05-18 23:45:40] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:45:40] [INFO ] Computed 42 place invariants in 29 ms
[2022-05-18 23:45:41] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s561 1) (GEQ s571 1)) (AND (GEQ s480 1) (GEQ s571 1)) (AND (GEQ s124 1) (GEQ s571 1)) (AND (GEQ s416 1) (GEQ s571 1)) (AND (GEQ s189 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 202 steps with 3 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-03 finished in 11444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((((p1 U (p2 U X(p3)))&&!p1) U p2))))'
Support contains 25 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 36 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 23:45:41] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:45:41] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:45:43] [INFO ] Dead Transitions using invariants and state equation in 1491 ms found 0 transitions.
[2022-05-18 23:45:43] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:45:43] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:45:43] [INFO ] Implicit Places using invariants in 508 ms returned []
[2022-05-18 23:45:43] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:45:43] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:45:44] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:45:51] [INFO ] Implicit Places using invariants and state equation in 7752 ms returned []
Implicit Place search using SMT with State Equation took 8294 ms to find 0 implicit places.
[2022-05-18 23:45:51] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:45:51] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:45:52] [INFO ] Dead Transitions using invariants and state equation in 1380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s173 1) (GEQ s110 1) (GEQ s234 1) (GEQ s21 1) (GEQ s509 1) (GEQ s415 1)), p2:(OR (AND (GEQ s46 7) (GEQ s182 1) (GEQ s193 1) (GEQ s502 1) (GEQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 452 steps with 4 reset in 10 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-04 finished in 11662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(G((G(p2) U (p3 U p2))))||p1)))'
Support contains 31 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 620 transition count 1476
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 584 transition count 1470
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 578 transition count 1470
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 84 place count 578 transition count 1392
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 240 place count 500 transition count 1392
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 246 place count 494 transition count 1386
Iterating global reduction 3 with 6 rules applied. Total rules applied 252 place count 494 transition count 1386
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 360 place count 440 transition count 1332
Applied a total of 360 rules in 89 ms. Remains 440 /620 variables (removed 180) and now considering 1332/1512 (removed 180) transitions.
[2022-05-18 23:45:53] [INFO ] Flow matrix only has 1296 transitions (discarded 36 similar events)
// Phase 1: matrix 1296 rows 440 cols
[2022-05-18 23:45:53] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 23:45:54] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
[2022-05-18 23:45:54] [INFO ] Flow matrix only has 1296 transitions (discarded 36 similar events)
// Phase 1: matrix 1296 rows 440 cols
[2022-05-18 23:45:54] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 23:45:54] [INFO ] Implicit Places using invariants in 439 ms returned []
[2022-05-18 23:45:54] [INFO ] Flow matrix only has 1296 transitions (discarded 36 similar events)
// Phase 1: matrix 1296 rows 440 cols
[2022-05-18 23:45:54] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 23:45:55] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:46:12] [INFO ] Implicit Places using invariants and state equation in 17304 ms returned []
Implicit Place search using SMT with State Equation took 17765 ms to find 0 implicit places.
[2022-05-18 23:46:12] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-18 23:46:12] [INFO ] Flow matrix only has 1296 transitions (discarded 36 similar events)
// Phase 1: matrix 1296 rows 440 cols
[2022-05-18 23:46:12] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 23:46:13] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 440/620 places, 1332/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 440/620 places, 1332/1512 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p2 p0) (AND (NOT p1) p3 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={0} source=0 dest: 3}], [{ cond=(OR p2 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s149 1) (GEQ s348 1)) (AND (GEQ s149 1) (GEQ s405 1)) (AND (GEQ s149 1) (GEQ s259 1)) (AND (GEQ s51 1) (GEQ s149 1)) (AND (GEQ s149 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 45 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-05 finished in 19964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 32 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 23:46:13] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:46:13] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:46:14] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
[2022-05-18 23:46:14] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:46:14] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 23:46:15] [INFO ] Implicit Places using invariants in 575 ms returned []
[2022-05-18 23:46:15] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:46:15] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:46:15] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:46:23] [INFO ] Implicit Places using invariants and state equation in 8504 ms returned []
Implicit Place search using SMT with State Equation took 9092 ms to find 0 implicit places.
[2022-05-18 23:46:23] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:46:23] [INFO ] Computed 42 place invariants in 50 ms
[2022-05-18 23:46:25] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s314 1) (LT s80 1) (LT s179 1) (LT s114 1) (LT s248 1) (LT s365 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 163 steps with 4 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-06 finished in 12060 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(p0) U !F(p0))))))'
Support contains 7 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 620 transition count 1470
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 578 transition count 1464
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 572 transition count 1464
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 96 place count 572 transition count 1386
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 252 place count 494 transition count 1386
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 256 place count 490 transition count 1382
Iterating global reduction 3 with 4 rules applied. Total rules applied 260 place count 490 transition count 1382
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 368 place count 436 transition count 1328
Applied a total of 368 rules in 75 ms. Remains 436 /620 variables (removed 184) and now considering 1328/1512 (removed 184) transitions.
[2022-05-18 23:46:25] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:25] [INFO ] Computed 42 place invariants in 24 ms
[2022-05-18 23:46:26] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
[2022-05-18 23:46:26] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:26] [INFO ] Computed 42 place invariants in 32 ms
[2022-05-18 23:46:26] [INFO ] Implicit Places using invariants in 559 ms returned []
[2022-05-18 23:46:26] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:27] [INFO ] Computed 42 place invariants in 38 ms
[2022-05-18 23:46:27] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:46:36] [INFO ] Implicit Places using invariants and state equation in 9724 ms returned []
Implicit Place search using SMT with State Equation took 10285 ms to find 0 implicit places.
[2022-05-18 23:46:36] [INFO ] Redundant transitions in 38 ms returned []
[2022-05-18 23:46:36] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:36] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-18 23:46:37] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 436/620 places, 1328/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 436/620 places, 1328/1512 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s189 1) (GEQ s250 1)) (AND (GEQ s159 1) (GEQ s250 1)) (AND (GEQ s250 1) (GEQ s323 1)) (AND (GEQ s19 1) (GEQ s250 1)) (AND (GEQ s67 1) (GE...], 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 1032 reset in 532 ms.
Product exploration explored 100000 steps with 1028 reset in 648 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 109 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 35 ms :[p0]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 278 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 61 ms :[p0]
Stuttering acceptance computed with spot in 24 ms :[p0]
Support contains 7 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 1328/1328 transitions.
Applied a total of 0 rules in 21 ms. Remains 436 /436 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2022-05-18 23:46:39] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:39] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 23:46:40] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
[2022-05-18 23:46:40] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:40] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 23:46:40] [INFO ] Implicit Places using invariants in 466 ms returned []
[2022-05-18 23:46:40] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:40] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 23:46:41] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:46:49] [INFO ] Implicit Places using invariants and state equation in 8130 ms returned []
Implicit Place search using SMT with State Equation took 8647 ms to find 0 implicit places.
[2022-05-18 23:46:49] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-18 23:46:49] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:49] [INFO ] Computed 42 place invariants in 29 ms
[2022-05-18 23:46:49] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 436/436 places, 1328/1328 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[p0]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 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 27 ms :[p0]
Stuttering acceptance computed with spot in 25 ms :[p0]
Stuttering acceptance computed with spot in 23 ms :[p0]
Product exploration explored 100000 steps with 1009 reset in 506 ms.
Product exploration explored 100000 steps with 1047 reset in 547 ms.
Built C files in :
/tmp/ltsmin7857318370874804514
[2022-05-18 23:46:51] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2022-05-18 23:46:51] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:51] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2022-05-18 23:46:51] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:51] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2022-05-18 23:46:51] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:51] [INFO ] Built C files in 252ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7857318370874804514
Running compilation step : cd /tmp/ltsmin7857318370874804514;'/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/ltsmin7857318370874804514;'/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/ltsmin7857318370874804514;'/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 7 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 1328/1328 transitions.
Applied a total of 0 rules in 64 ms. Remains 436 /436 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2022-05-18 23:46:54] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:54] [INFO ] Computed 42 place invariants in 37 ms
[2022-05-18 23:46:55] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
[2022-05-18 23:46:55] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:55] [INFO ] Computed 42 place invariants in 30 ms
[2022-05-18 23:46:56] [INFO ] Implicit Places using invariants in 790 ms returned []
[2022-05-18 23:46:56] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:46:56] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 23:46:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:47:06] [INFO ] Implicit Places using invariants and state equation in 9924 ms returned []
Implicit Place search using SMT with State Equation took 10715 ms to find 0 implicit places.
[2022-05-18 23:47:06] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-18 23:47:06] [INFO ] Flow matrix only has 1292 transitions (discarded 36 similar events)
// Phase 1: matrix 1292 rows 436 cols
[2022-05-18 23:47:06] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 23:47:07] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 436/436 places, 1328/1328 transitions.
Built C files in :
/tmp/ltsmin11395787822592430043
[2022-05-18 23:47:07] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2022-05-18 23:47:07] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:47:07] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2022-05-18 23:47:07] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:47:07] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2022-05-18 23:47:07] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:47:07] [INFO ] Built C files in 247ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11395787822592430043
Running compilation step : cd /tmp/ltsmin11395787822592430043;'/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/ltsmin11395787822592430043;'/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/ltsmin11395787822592430043;'/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-18 23:47:10] [INFO ] Flatten gal took : 126 ms
[2022-05-18 23:47:11] [INFO ] Flatten gal took : 75 ms
[2022-05-18 23:47:11] [INFO ] Time to serialize gal into /tmp/LTL16064503471606391969.gal : 14 ms
[2022-05-18 23:47:11] [INFO ] Time to serialize properties into /tmp/LTL2254258293364155178.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/LTL16064503471606391969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2254258293364155178.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/LTL1606450...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F((X("(((((Check_Sources_E_6>=1)&&(ORB_Lock>=1))||((Check_Sources_E_5>=1)&&(ORB_Lock>=1)))||(((ORB_Lock>=1)&&(Check_Sources_E_1...561
Formula 0 simplified : !XGF(X"(((((Check_Sources_E_6>=1)&&(ORB_Lock>=1))||((Check_Sources_E_5>=1)&&(ORB_Lock>=1)))||(((ORB_Lock>=1)&&(Check_Sources_E_1>=1)...547
Detected timeout of ITS tools.
[2022-05-18 23:47:26] [INFO ] Flatten gal took : 55 ms
[2022-05-18 23:47:26] [INFO ] Applying decomposition
[2022-05-18 23:47:26] [INFO ] Flatten gal took : 54 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/graph1992868545831699799.txt' '-o' '/tmp/graph1992868545831699799.bin' '-w' '/tmp/graph1992868545831699799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1992868545831699799.bin' '-l' '-1' '-v' '-w' '/tmp/graph1992868545831699799.weights' '-q' '0' '-e' '0.001'
[2022-05-18 23:47:26] [INFO ] Decomposing Gal with order
[2022-05-18 23:47:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 23:47:26] [INFO ] Removed a total of 872 redundant transitions.
[2022-05-18 23:47:26] [INFO ] Flatten gal took : 264 ms
[2022-05-18 23:47:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 34 ms.
[2022-05-18 23:47:26] [INFO ] Time to serialize gal into /tmp/LTL16469609010929682137.gal : 25 ms
[2022-05-18 23:47:26] [INFO ] Time to serialize properties into /tmp/LTL1633170438497506426.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/LTL16469609010929682137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1633170438497506426.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/LTL1646960...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F((X("(((((i2.u12.Check_Sources_E_6>=1)&&(i6.u19.ORB_Lock>=1))||((i2.u17.Check_Sources_E_5>=1)&&(i6.u19.ORB_Lock>=1)))||(((i6.u...725
Formula 0 simplified : !XGF(X"(((((i2.u12.Check_Sources_E_6>=1)&&(i6.u19.ORB_Lock>=1))||((i2.u17.Check_Sources_E_5>=1)&&(i6.u19.ORB_Lock>=1)))||(((i6.u19.O...711
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4502001556882350708
[2022-05-18 23:47:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4502001556882350708
Running compilation step : cd /tmp/ltsmin4502001556882350708;'/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 2942 ms.
Running link step : cd /tmp/ltsmin4502001556882350708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4502001556882350708;'/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)) U !<>((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 2214 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-07 finished in 81867 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U (p1 U p2)) U !X(X(F(p3)))))'
Support contains 8 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 615 transition count 1507
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 615 transition count 1507
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 611 transition count 1503
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 611 transition count 1503
Applied a total of 18 rules in 39 ms. Remains 611 /620 variables (removed 9) and now considering 1503/1512 (removed 9) transitions.
[2022-05-18 23:47:47] [INFO ] Flow matrix only has 1467 transitions (discarded 36 similar events)
// Phase 1: matrix 1467 rows 611 cols
[2022-05-18 23:47:47] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:47:48] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
[2022-05-18 23:47:48] [INFO ] Flow matrix only has 1467 transitions (discarded 36 similar events)
// Phase 1: matrix 1467 rows 611 cols
[2022-05-18 23:47:48] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:47:49] [INFO ] Implicit Places using invariants in 572 ms returned []
[2022-05-18 23:47:49] [INFO ] Flow matrix only has 1467 transitions (discarded 36 similar events)
// Phase 1: matrix 1467 rows 611 cols
[2022-05-18 23:47:49] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:47:50] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:50:29] [INFO ] Performed 0/611 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-18 23:50:29] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-18 23:50:29] [INFO ] Implicit Places using invariants and state equation in 160044 ms returned []
Implicit Place search using SMT with State Equation took 160627 ms to find 0 implicit places.
[2022-05-18 23:50:29] [INFO ] Flow matrix only has 1467 transitions (discarded 36 similar events)
// Phase 1: matrix 1467 rows 611 cols
[2022-05-18 23:50:29] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:50:30] [INFO ] Dead Transitions using invariants and state equation in 1512 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 611/620 places, 1503/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 611/620 places, 1503/1512 transitions.
Stuttering acceptance computed with spot in 344 ms :[p3, (AND p2 p3), (AND p2 p3), p3, true, p3, (AND p2 p3), (AND p2 p3), p2, (AND p2 (NOT p3))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=p3, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p3), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 p3), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=7 dest: 9}], [{ cond=p2, acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 9}]], initial=5, aps=[p2:(GEQ s540 1), p1:(AND (GEQ s104 1) (GEQ s208 1) (GEQ s323 1)), p0:(GEQ s369 1), p3:(OR (LT s21 1) (AND (GEQ s170 1) (GEQ s299 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-08 finished in 164105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!G((G(p0) U X(!p1))) U p1)))'
Support contains 4 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 620 transition count 1460
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 568 transition count 1459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 567 transition count 1459
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 106 place count 567 transition count 1387
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 250 place count 495 transition count 1387
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 254 place count 491 transition count 1383
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 491 transition count 1383
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 402 place count 419 transition count 1311
Applied a total of 402 rules in 71 ms. Remains 419 /620 variables (removed 201) and now considering 1311/1512 (removed 201) transitions.
[2022-05-18 23:50:31] [INFO ] Flow matrix only has 1275 transitions (discarded 36 similar events)
// Phase 1: matrix 1275 rows 419 cols
[2022-05-18 23:50:31] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 23:50:32] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
[2022-05-18 23:50:32] [INFO ] Flow matrix only has 1275 transitions (discarded 36 similar events)
// Phase 1: matrix 1275 rows 419 cols
[2022-05-18 23:50:32] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 23:50:33] [INFO ] Implicit Places using invariants in 517 ms returned []
[2022-05-18 23:50:33] [INFO ] Flow matrix only has 1275 transitions (discarded 36 similar events)
// Phase 1: matrix 1275 rows 419 cols
[2022-05-18 23:50:33] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 23:50:33] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:50:38] [INFO ] Implicit Places using invariants and state equation in 5613 ms returned []
Implicit Place search using SMT with State Equation took 6149 ms to find 0 implicit places.
[2022-05-18 23:50:38] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-18 23:50:38] [INFO ] Flow matrix only has 1275 transitions (discarded 36 similar events)
// Phase 1: matrix 1275 rows 419 cols
[2022-05-18 23:50:38] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 23:50:39] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/620 places, 1311/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/620 places, 1311/1512 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s218 1) (GEQ s235 1)), p0:(AND (GEQ s278 1) (GEQ s291 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-10 finished in 8373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(G(p0)))&&p1)))))'
Support contains 5 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 25 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 23:50:39] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:50:39] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 23:50:41] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
[2022-05-18 23:50:41] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:50:41] [INFO ] Computed 42 place invariants in 24 ms
[2022-05-18 23:50:41] [INFO ] Implicit Places using invariants in 586 ms returned []
[2022-05-18 23:50:41] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:50:41] [INFO ] Computed 42 place invariants in 25 ms
[2022-05-18 23:50:42] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:50:49] [INFO ] Implicit Places using invariants and state equation in 7403 ms returned []
Implicit Place search using SMT with State Equation took 7999 ms to find 0 implicit places.
[2022-05-18 23:50:49] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:50:49] [INFO ] Computed 42 place invariants in 39 ms
[2022-05-18 23:50:50] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 4}, { cond=p1, acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s276 1) (GEQ s310 1)) (AND (GEQ s277 1) (GEQ s449 1))), p0:(AND (GEQ s56 1) (GEQ s276 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 446 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-11 finished in 11199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(!X(X(p0))) U p0)||G(p1)))))'
Support contains 6 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 55 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 23:50:50] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:50:51] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 23:50:52] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
[2022-05-18 23:50:52] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:50:52] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 23:50:52] [INFO ] Implicit Places using invariants in 570 ms returned []
[2022-05-18 23:50:52] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:50:52] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 23:50:53] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:50:59] [INFO ] Implicit Places using invariants and state equation in 6699 ms returned []
Implicit Place search using SMT with State Equation took 7292 ms to find 0 implicit places.
[2022-05-18 23:50:59] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:50:59] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 23:51:01] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1), p0, p0, true, (AND p0 (NOT p1)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p0 p1), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={} source=10 dest: 7}, { cond=p1, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s46 9) (GEQ s134 1) (GEQ s182 1)), p1:(AND (GEQ s296 1) (GEQ s442 1) (GEQ s458 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 849 steps with 123 reset in 6 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-13 finished in 10642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 1512/1512 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 614 transition count 1506
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 614 transition count 1506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 608 transition count 1500
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 608 transition count 1500
Applied a total of 24 rules in 25 ms. Remains 608 /620 variables (removed 12) and now considering 1500/1512 (removed 12) transitions.
[2022-05-18 23:51:01] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:51:01] [INFO ] Computed 42 place invariants in 28 ms
[2022-05-18 23:51:02] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
[2022-05-18 23:51:02] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:51:03] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:51:03] [INFO ] Implicit Places using invariants in 591 ms returned []
[2022-05-18 23:51:03] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:51:03] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 23:51:04] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 23:51:11] [INFO ] Implicit Places using invariants and state equation in 7571 ms returned []
Implicit Place search using SMT with State Equation took 8178 ms to find 0 implicit places.
[2022-05-18 23:51:11] [INFO ] Flow matrix only has 1464 transitions (discarded 36 similar events)
// Phase 1: matrix 1464 rows 608 cols
[2022-05-18 23:51:11] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 23:51:12] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/620 places, 1500/1512 transitions.
Finished structural reductions, in 1 iterations. Remains : 608/620 places, 1500/1512 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s308 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 360 steps with 1 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLFireability-15 finished in 11102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(p0)))))'
[2022-05-18 23:51:12] [INFO ] Flatten gal took : 57 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10230438970053607855
[2022-05-18 23:51:12] [INFO ] Too many transitions (1512) to apply POR reductions. Disabling POR matrices.
[2022-05-18 23:51:12] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10230438970053607855
Running compilation step : cd /tmp/ltsmin10230438970053607855;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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-18 23:51:13] [INFO ] Applying decomposition
[2022-05-18 23:51:13] [INFO ] Flatten gal took : 76 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/graph2297613987388744532.txt' '-o' '/tmp/graph2297613987388744532.bin' '-w' '/tmp/graph2297613987388744532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2297613987388744532.bin' '-l' '-1' '-v' '-w' '/tmp/graph2297613987388744532.weights' '-q' '0' '-e' '0.001'
[2022-05-18 23:51:13] [INFO ] Decomposing Gal with order
[2022-05-18 23:51:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 23:51:13] [INFO ] Removed a total of 1058 redundant transitions.
[2022-05-18 23:51:13] [INFO ] Flatten gal took : 226 ms
[2022-05-18 23:51:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 41 ms.
[2022-05-18 23:51:13] [INFO ] Time to serialize gal into /tmp/LTLFireability18366111928947856238.gal : 11 ms
[2022-05-18 23:51:13] [INFO ] Time to serialize properties into /tmp/LTLFireability3729051406490986593.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/LTLFireability18366111928947856238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3729051406490986593.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((((((((i8.u16.P_1717<1)||(i8.u45.P_1724_4<1))||(i8.u16.FetchJobB_4<1))&&(((i8.u16.P_1717<1)||(i8.u45.P_1724_4<1))||(i8.u1...2136
Formula 0 simplified : !XFGF"((((((((i8.u16.P_1717<1)||(i8.u45.P_1724_4<1))||(i8.u16.FetchJobB_4<1))&&(((i8.u16.P_1717<1)||(i8.u45.P_1724_4<1))||(i8.u16.Fe...2126
Compilation finished in 3943 ms.
Running link step : cd /tmp/ltsmin10230438970053607855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10230438970053607855;'/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)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 00:15:26] [INFO ] Flatten gal took : 193 ms
[2022-05-19 00:15:26] [INFO ] Time to serialize gal into /tmp/LTLFireability15496708983369971040.gal : 13 ms
[2022-05-19 00:15:26] [INFO ] Time to serialize properties into /tmp/LTLFireability3586323312536816939.ltl : 5 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/LTLFireability15496708983369971040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3586323312536816939.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F("((((((((P_1717<1)||(P_1724_4<1))||(FetchJobB_4<1))&&(((P_1717<1)||(P_1724_4<1))||(FetchJobB_2<1)))&&((((P_1717<1)||(FetchJ...1506
Formula 0 simplified : !XFGF"((((((((P_1717<1)||(P_1724_4<1))||(FetchJobB_4<1))&&(((P_1717<1)||(P_1724_4<1))||(FetchJobB_2<1)))&&((((P_1717<1)||(FetchJobB_...1496
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: LTL layer: formula: X(<>([](<>((LTLAPp0==true)))))
pins2lts-mc-linux64( 0/ 8), 0.006: "X(<>([](<>((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.051: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.231: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.480: DFS-FIFO for weak LTL, using special progress label 1514
pins2lts-mc-linux64( 0/ 8), 0.480: There are 1515 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.480: State length is 621, there are 1515 groups
pins2lts-mc-linux64( 0/ 8), 0.480: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.480: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.480: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.480: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.649: ~1 levels ~960 states ~4736 transitions
pins2lts-mc-linux64( 4/ 8), 2.023: ~1 levels ~1920 states ~7144 transitions
pins2lts-mc-linux64( 4/ 8), 2.606: ~1 levels ~3840 states ~16480 transitions
pins2lts-mc-linux64( 1/ 8), 3.592: ~1 levels ~7680 states ~37184 transitions
pins2lts-mc-linux64( 5/ 8), 5.135: ~1 levels ~15360 states ~42016 transitions
pins2lts-mc-linux64( 5/ 8), 9.556: ~1 levels ~30720 states ~76832 transitions
pins2lts-mc-linux64( 5/ 8), 15.799: ~1 levels ~61440 states ~135672 transitions
pins2lts-mc-linux64( 5/ 8), 29.842: ~1 levels ~122880 states ~320760 transitions
pins2lts-mc-linux64( 5/ 8), 52.989: ~1 levels ~245760 states ~721880 transitions
pins2lts-mc-linux64( 5/ 8), 96.227: ~1 levels ~491520 states ~1473912 transitions
pins2lts-mc-linux64( 7/ 8), 164.540: ~1 levels ~983040 states ~3613856 transitions
pins2lts-mc-linux64( 0/ 8), 233.179: ~1 levels ~1966080 states ~9985600 transitions
pins2lts-mc-linux64( 0/ 8), 344.586: ~1 levels ~3932160 states ~19542520 transitions
pins2lts-mc-linux64( 0/ 8), 565.528: ~1 levels ~7864320 states ~38554456 transitions
pins2lts-mc-linux64( 0/ 8), 1066.303: ~1 levels ~15728640 states ~75923056 transitions
pins2lts-mc-linux64( 0/ 8), 1836.509: ~1 levels ~31457280 states ~147024896 transitions
pins2lts-mc-linux64( 2/ 8), 1948.440: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1948.467:
pins2lts-mc-linux64( 0/ 8), 1948.467: mean standard work distribution: 10.9% (states) 27.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1948.467:
pins2lts-mc-linux64( 0/ 8), 1948.467: Explored 28314906 states 114692983 transitions, fanout: 4.051
pins2lts-mc-linux64( 0/ 8), 1948.467: Total exploration time 1947.970 sec (1947.910 sec minimum, 1947.944 sec on average)
pins2lts-mc-linux64( 0/ 8), 1948.467: States per second: 14536, Transitions per second: 58878
pins2lts-mc-linux64( 0/ 8), 1948.467:
pins2lts-mc-linux64( 0/ 8), 1948.467: Progress states detected: 39885549
pins2lts-mc-linux64( 0/ 8), 1948.467: Redundant explorations: -29.0315
pins2lts-mc-linux64( 0/ 8), 1948.467:
pins2lts-mc-linux64( 0/ 8), 1948.467: Queue width: 8B, total height: 21256079, memory: 162.17MB
pins2lts-mc-linux64( 0/ 8), 1948.467: Tree memory: 560.4MB, 14.7 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1948.467: Tree fill ratio (roots/leafs): 29.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1948.467: Stored 1539 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1948.467: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1948.467: Est. total memory use: 722.6MB (~1186.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10230438970053607855;'/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)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10230438970053607855;'/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)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S06J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017000692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;