About the Execution of ITS-Tools for FlexibleBarrier-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.804 | 3600000.00 | 13721788.00 | 27006.10 | FFFTTTFFFFFF?FTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850600579.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FlexibleBarrier-PT-20b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850600579
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 FlexibleBarrier-PT-20b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679513930811
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 19:38:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 19:38:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:38:52] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-22 19:38:52] [INFO ] Transformed 5372 places.
[2023-03-22 19:38:52] [INFO ] Transformed 6193 transitions.
[2023-03-22 19:38:52] [INFO ] Found NUPN structural information;
[2023-03-22 19:38:52] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 5372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Discarding 2254 places :
Symmetric choice reduction at 0 with 2254 rule applications. Total rules 2254 place count 3118 transition count 3939
Iterating global reduction 0 with 2254 rules applied. Total rules applied 4508 place count 3118 transition count 3939
Discarding 1067 places :
Symmetric choice reduction at 0 with 1067 rule applications. Total rules 5575 place count 2051 transition count 2872
Iterating global reduction 0 with 1067 rules applied. Total rules applied 6642 place count 2051 transition count 2872
Discarding 687 places :
Symmetric choice reduction at 0 with 687 rule applications. Total rules 7329 place count 1364 transition count 2185
Iterating global reduction 0 with 687 rules applied. Total rules applied 8016 place count 1364 transition count 2185
Ensure Unique test removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Iterating post reduction 0 with 332 rules applied. Total rules applied 8348 place count 1364 transition count 1853
Applied a total of 8348 rules in 1204 ms. Remains 1364 /5372 variables (removed 4008) and now considering 1853/6193 (removed 4340) transitions.
// Phase 1: matrix 1853 rows 1364 cols
[2023-03-22 19:38:54] [INFO ] Computed 22 place invariants in 71 ms
[2023-03-22 19:38:54] [INFO ] Implicit Places using invariants in 778 ms returned []
[2023-03-22 19:38:54] [INFO ] Invariant cache hit.
[2023-03-22 19:38:56] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2023-03-22 19:38:56] [INFO ] Invariant cache hit.
[2023-03-22 19:38:56] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1364/5372 places, 1853/6193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4037 ms. Remains : 1364/5372 places, 1853/6193 transitions.
Support contains 42 out of 1364 places after structural reductions.
[2023-03-22 19:38:57] [INFO ] Flatten gal took : 133 ms
[2023-03-22 19:38:57] [INFO ] Flatten gal took : 77 ms
[2023-03-22 19:38:57] [INFO ] Input system was already deterministic with 1853 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-22 19:38:57] [INFO ] Invariant cache hit.
[2023-03-22 19:38:58] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-22 19:38:58] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 19:38:59] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-22 19:39:00] [INFO ] After 1308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 19:39:00] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 5 ms to minimize.
[2023-03-22 19:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-22 19:39:01] [INFO ] Deduced a trap composed of 423 places in 450 ms of which 3 ms to minimize.
[2023-03-22 19:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 562 ms
[2023-03-22 19:39:02] [INFO ] After 3378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 779 ms.
[2023-03-22 19:39:03] [INFO ] After 4982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 6 properties in 139 ms.
Support contains 17 out of 1364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Graph (trivial) has 1277 edges and 1364 vertex of which 121 / 1364 are part of one of the 20 SCC in 5 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 1263 transition count 1640
Reduce places removed 91 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 92 rules applied. Total rules applied 184 place count 1172 transition count 1639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 185 place count 1171 transition count 1639
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 185 place count 1171 transition count 1587
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 289 place count 1119 transition count 1587
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 350 place count 1058 transition count 1526
Iterating global reduction 3 with 61 rules applied. Total rules applied 411 place count 1058 transition count 1526
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 417 place count 1058 transition count 1520
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 417 place count 1058 transition count 1519
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 419 place count 1057 transition count 1519
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 432 place count 1044 transition count 1506
Iterating global reduction 4 with 13 rules applied. Total rules applied 445 place count 1044 transition count 1506
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 455 place count 1044 transition count 1496
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 5 with 252 rules applied. Total rules applied 707 place count 918 transition count 1370
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 747 place count 918 transition count 1330
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 770 place count 895 transition count 1307
Iterating global reduction 6 with 23 rules applied. Total rules applied 793 place count 895 transition count 1307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 796 place count 895 transition count 1304
Free-agglomeration rule applied 767 times.
Iterating global reduction 7 with 767 rules applied. Total rules applied 1563 place count 895 transition count 537
Reduce places removed 767 places and 0 transitions.
Drop transitions removed 355 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 355 edges and 128 vertex of which 113 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 1123 rules applied. Total rules applied 2686 place count 113 transition count 182
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 2707 place count 113 transition count 161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2708 place count 112 transition count 160
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 85 edges and 111 vertex of which 32 / 111 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 2710 place count 95 transition count 160
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 10 with 32 rules applied. Total rules applied 2742 place count 95 transition count 128
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 17 Pre rules applied. Total rules applied 2742 place count 95 transition count 111
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 2776 place count 78 transition count 111
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 2793 place count 78 transition count 94
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 2831 place count 59 transition count 75
Free-agglomeration rule applied 16 times.
Iterating global reduction 12 with 16 rules applied. Total rules applied 2847 place count 59 transition count 59
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 12 with 43 rules applied. Total rules applied 2890 place count 32 transition count 43
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 2893 place count 32 transition count 40
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2896 place count 29 transition count 40
Applied a total of 2896 rules in 1313 ms. Remains 29 /1364 variables (removed 1335) and now considering 40/1853 (removed 1813) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1313 ms. Remains : 29/1364 places, 40/1853 transitions.
Finished random walk after 535 steps, including 0 resets, run visited all 9 properties in 4 ms. (steps per millisecond=133 )
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 22 stabilizing places and 22 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1||G(p2))))))'
Support contains 4 out of 1364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Graph (trivial) has 1298 edges and 1364 vertex of which 121 / 1364 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 1262 transition count 1646
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 1158 transition count 1646
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 209 place count 1158 transition count 1595
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 311 place count 1107 transition count 1595
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 384 place count 1034 transition count 1522
Iterating global reduction 2 with 73 rules applied. Total rules applied 457 place count 1034 transition count 1522
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 465 place count 1034 transition count 1514
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 465 place count 1034 transition count 1512
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 469 place count 1032 transition count 1512
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 483 place count 1018 transition count 1498
Iterating global reduction 3 with 14 rules applied. Total rules applied 497 place count 1018 transition count 1498
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 510 place count 1018 transition count 1485
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 754 place count 896 transition count 1363
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 759 place count 891 transition count 1358
Iterating global reduction 4 with 5 rules applied. Total rules applied 764 place count 891 transition count 1358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 769 place count 891 transition count 1353
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 789 place count 891 transition count 1333
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 791 place count 889 transition count 1331
Applied a total of 791 rules in 776 ms. Remains 889 /1364 variables (removed 475) and now considering 1331/1853 (removed 522) transitions.
[2023-03-22 19:39:06] [INFO ] Flow matrix only has 1292 transitions (discarded 39 similar events)
// Phase 1: matrix 1292 rows 889 cols
[2023-03-22 19:39:06] [INFO ] Computed 22 place invariants in 71 ms
[2023-03-22 19:39:06] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-22 19:39:06] [INFO ] Flow matrix only has 1292 transitions (discarded 39 similar events)
[2023-03-22 19:39:06] [INFO ] Invariant cache hit.
[2023-03-22 19:39:07] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
[2023-03-22 19:39:07] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-22 19:39:07] [INFO ] Flow matrix only has 1292 transitions (discarded 39 similar events)
[2023-03-22 19:39:07] [INFO ] Invariant cache hit.
[2023-03-22 19:39:08] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 889/1364 places, 1331/1853 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2865 ms. Remains : 889/1364 places, 1331/1853 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s650 0) (EQ s471 1)), p1:(AND (EQ s743 0) (EQ s384 1)), p2:(OR (EQ s384 0) (EQ s743 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-00 finished in 3176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 1364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1330 transition count 1819
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1330 transition count 1819
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 1330 transition count 1811
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 102 place count 1304 transition count 1785
Iterating global reduction 1 with 26 rules applied. Total rules applied 128 place count 1304 transition count 1785
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 141 place count 1304 transition count 1772
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 151 place count 1294 transition count 1762
Iterating global reduction 2 with 10 rules applied. Total rules applied 161 place count 1294 transition count 1762
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 167 place count 1294 transition count 1756
Applied a total of 167 rules in 217 ms. Remains 1294 /1364 variables (removed 70) and now considering 1756/1853 (removed 97) transitions.
// Phase 1: matrix 1756 rows 1294 cols
[2023-03-22 19:39:08] [INFO ] Computed 22 place invariants in 35 ms
[2023-03-22 19:39:09] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-22 19:39:09] [INFO ] Invariant cache hit.
[2023-03-22 19:39:10] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2023-03-22 19:39:10] [INFO ] Invariant cache hit.
[2023-03-22 19:39:11] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1294/1364 places, 1756/1853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2708 ms. Remains : 1294/1364 places, 1756/1853 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s159 0) (EQ s612 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 680 ms.
Product exploration explored 100000 steps with 25000 reset in 568 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 536465 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536465 steps, saw 242567 distinct states, run finished after 3002 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:39:15] [INFO ] Invariant cache hit.
[2023-03-22 19:39:16] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:39:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-22 19:39:16] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:39:16] [INFO ] After 597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-22 19:39:16] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1294/1294 places, 1756/1756 transitions.
Graph (trivial) has 1229 edges and 1294 vertex of which 121 / 1294 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 1193 transition count 1538
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 1097 transition count 1538
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 193 place count 1097 transition count 1496
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 277 place count 1055 transition count 1496
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 316 place count 1016 transition count 1457
Iterating global reduction 2 with 39 rules applied. Total rules applied 355 place count 1016 transition count 1457
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 357 place count 1014 transition count 1455
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 1014 transition count 1455
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 607 place count 890 transition count 1331
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 647 place count 890 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 667 place count 870 transition count 1271
Iterating global reduction 3 with 20 rules applied. Total rules applied 687 place count 870 transition count 1271
Free-agglomeration rule applied 764 times.
Iterating global reduction 3 with 764 rules applied. Total rules applied 1451 place count 870 transition count 507
Reduce places removed 764 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 291 edges and 106 vertex of which 26 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.0 ms
Discarding 80 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1126 rules applied. Total rules applied 2577 place count 26 transition count 146
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 2689 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2690 place count 25 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 28 edges and 23 vertex of which 20 / 23 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 2693 place count 7 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 2723 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2723 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2725 place count 4 transition count 4
Applied a total of 2725 rules in 274 ms. Remains 4 /1294 variables (removed 1290) and now considering 4/1756 (removed 1752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 4/1294 places, 4/1756 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 1294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1294/1294 places, 1756/1756 transitions.
Applied a total of 0 rules in 35 ms. Remains 1294 /1294 variables (removed 0) and now considering 1756/1756 (removed 0) transitions.
[2023-03-22 19:39:17] [INFO ] Invariant cache hit.
[2023-03-22 19:39:18] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-22 19:39:18] [INFO ] Invariant cache hit.
[2023-03-22 19:39:19] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2023-03-22 19:39:19] [INFO ] Invariant cache hit.
[2023-03-22 19:39:20] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2432 ms. Remains : 1294/1294 places, 1756/1756 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 553215 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 553215 steps, saw 248582 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:39:23] [INFO ] Invariant cache hit.
[2023-03-22 19:39:23] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:39:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2023-03-22 19:39:24] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:39:24] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 19:39:24] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1294/1294 places, 1756/1756 transitions.
Graph (trivial) has 1229 edges and 1294 vertex of which 121 / 1294 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 1193 transition count 1538
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 1097 transition count 1538
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 193 place count 1097 transition count 1496
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 277 place count 1055 transition count 1496
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 316 place count 1016 transition count 1457
Iterating global reduction 2 with 39 rules applied. Total rules applied 355 place count 1016 transition count 1457
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 357 place count 1014 transition count 1455
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 1014 transition count 1455
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 607 place count 890 transition count 1331
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 647 place count 890 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 667 place count 870 transition count 1271
Iterating global reduction 3 with 20 rules applied. Total rules applied 687 place count 870 transition count 1271
Free-agglomeration rule applied 764 times.
Iterating global reduction 3 with 764 rules applied. Total rules applied 1451 place count 870 transition count 507
Reduce places removed 764 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 291 edges and 106 vertex of which 26 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.0 ms
Discarding 80 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1126 rules applied. Total rules applied 2577 place count 26 transition count 146
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 2689 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2690 place count 25 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 28 edges and 23 vertex of which 20 / 23 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 2693 place count 7 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 2723 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2723 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2725 place count 4 transition count 4
Applied a total of 2725 rules in 333 ms. Remains 4 /1294 variables (removed 1290) and now considering 4/1756 (removed 1752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 4/1294 places, 4/1756 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 537 ms.
Product exploration explored 100000 steps with 25000 reset in 541 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 1294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1294/1294 places, 1756/1756 transitions.
Graph (trivial) has 1229 edges and 1294 vertex of which 121 / 1294 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 1193 transition count 1654
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 57 Pre rules applied. Total rules applied 80 place count 1193 transition count 1654
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 57 rules applied. Total rules applied 137 place count 1193 transition count 1654
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 231 place count 1099 transition count 1560
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 325 place count 1099 transition count 1560
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 327 place count 1097 transition count 1558
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 329 place count 1097 transition count 1558
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 435 place count 1097 transition count 1598
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 480 place count 1052 transition count 1553
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 525 place count 1052 transition count 1553
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 545 place count 1052 transition count 1593
Deduced a syphon composed of 162 places in 0 ms
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 585 place count 1052 transition count 1553
Deduced a syphon composed of 162 places in 0 ms
Applied a total of 585 rules in 731 ms. Remains 1052 /1294 variables (removed 242) and now considering 1553/1756 (removed 203) transitions.
[2023-03-22 19:39:27] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-22 19:39:27] [INFO ] Flow matrix only has 1514 transitions (discarded 39 similar events)
// Phase 1: matrix 1514 rows 1052 cols
[2023-03-22 19:39:27] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-22 19:39:28] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1052/1294 places, 1553/1756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1454 ms. Remains : 1052/1294 places, 1553/1756 transitions.
Built C files in :
/tmp/ltsmin1359027980568235908
[2023-03-22 19:39:28] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1359027980568235908
Running compilation step : cd /tmp/ltsmin1359027980568235908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1359027980568235908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1359027980568235908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1294/1294 places, 1756/1756 transitions.
Applied a total of 0 rules in 32 ms. Remains 1294 /1294 variables (removed 0) and now considering 1756/1756 (removed 0) transitions.
// Phase 1: matrix 1756 rows 1294 cols
[2023-03-22 19:39:31] [INFO ] Computed 22 place invariants in 36 ms
[2023-03-22 19:39:31] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-22 19:39:31] [INFO ] Invariant cache hit.
[2023-03-22 19:39:33] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
[2023-03-22 19:39:33] [INFO ] Invariant cache hit.
[2023-03-22 19:39:33] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2421 ms. Remains : 1294/1294 places, 1756/1756 transitions.
Built C files in :
/tmp/ltsmin14694115147888964763
[2023-03-22 19:39:33] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14694115147888964763
Running compilation step : cd /tmp/ltsmin14694115147888964763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14694115147888964763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14694115147888964763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 19:39:36] [INFO ] Flatten gal took : 55 ms
[2023-03-22 19:39:37] [INFO ] Flatten gal took : 54 ms
[2023-03-22 19:39:37] [INFO ] Time to serialize gal into /tmp/LTL8000408160048919770.gal : 12 ms
[2023-03-22 19:39:37] [INFO ] Time to serialize properties into /tmp/LTL7707811337309030717.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8000408160048919770.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1816267620794780998.hoa' '-atoms' '/tmp/LTL7707811337309030717.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7707811337309030717.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1816267620794780998.hoa
Detected timeout of ITS tools.
[2023-03-22 19:39:52] [INFO ] Flatten gal took : 49 ms
[2023-03-22 19:39:52] [INFO ] Flatten gal took : 88 ms
[2023-03-22 19:39:52] [INFO ] Time to serialize gal into /tmp/LTL10600854994936036838.gal : 26 ms
[2023-03-22 19:39:52] [INFO ] Time to serialize properties into /tmp/LTL536438412246953092.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10600854994936036838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL536438412246953092.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X("((p604==0)||(p2423==1))")))))
Formula 0 simplified : XXX!"((p604==0)||(p2423==1))"
Detected timeout of ITS tools.
[2023-03-22 19:40:07] [INFO ] Flatten gal took : 73 ms
[2023-03-22 19:40:07] [INFO ] Applying decomposition
[2023-03-22 19:40:07] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9589963178398284731.txt' '-o' '/tmp/graph9589963178398284731.bin' '-w' '/tmp/graph9589963178398284731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9589963178398284731.bin' '-l' '-1' '-v' '-w' '/tmp/graph9589963178398284731.weights' '-q' '0' '-e' '0.001'
[2023-03-22 19:40:08] [INFO ] Decomposing Gal with order
[2023-03-22 19:40:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 19:40:08] [INFO ] Removed a total of 519 redundant transitions.
[2023-03-22 19:40:08] [INFO ] Flatten gal took : 557 ms
[2023-03-22 19:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 23 ms.
[2023-03-22 19:40:08] [INFO ] Time to serialize gal into /tmp/LTL3329989074679981648.gal : 19 ms
[2023-03-22 19:40:08] [INFO ] Time to serialize properties into /tmp/LTL9360302089664754240.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3329989074679981648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9360302089664754240.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X("((i4.u43.p604==0)||(i15.u146.p2423==1))")))))
Formula 0 simplified : XXX!"((i4.u43.p604==0)||(i15.u146.p2423==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5846892560004855582
[2023-03-22 19:40:23] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5846892560004855582
Running compilation step : cd /tmp/ltsmin5846892560004855582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5846892560004855582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5846892560004855582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-03 finished in 78392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1329 transition count 1818
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1329 transition count 1818
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 78 place count 1329 transition count 1810
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 105 place count 1302 transition count 1783
Iterating global reduction 1 with 27 rules applied. Total rules applied 132 place count 1302 transition count 1783
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 146 place count 1302 transition count 1769
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 156 place count 1292 transition count 1759
Iterating global reduction 2 with 10 rules applied. Total rules applied 166 place count 1292 transition count 1759
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 173 place count 1292 transition count 1752
Applied a total of 173 rules in 163 ms. Remains 1292 /1364 variables (removed 72) and now considering 1752/1853 (removed 101) transitions.
// Phase 1: matrix 1752 rows 1292 cols
[2023-03-22 19:40:27] [INFO ] Computed 22 place invariants in 36 ms
[2023-03-22 19:40:27] [INFO ] Implicit Places using invariants in 616 ms returned []
[2023-03-22 19:40:27] [INFO ] Invariant cache hit.
[2023-03-22 19:40:28] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
[2023-03-22 19:40:28] [INFO ] Invariant cache hit.
[2023-03-22 19:40:29] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1364 places, 1752/1853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2688 ms. Remains : 1292/1364 places, 1752/1853 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s997 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]]
Product exploration explored 100000 steps with 50000 reset in 968 ms.
Product exploration explored 100000 steps with 50000 reset in 949 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-04 finished in 4788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p1)))&&p0)))'
Support contains 5 out of 1364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1333 transition count 1822
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1333 transition count 1822
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 70 place count 1333 transition count 1814
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 93 place count 1310 transition count 1791
Iterating global reduction 1 with 23 rules applied. Total rules applied 116 place count 1310 transition count 1791
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 128 place count 1310 transition count 1779
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 137 place count 1301 transition count 1770
Iterating global reduction 2 with 9 rules applied. Total rules applied 146 place count 1301 transition count 1770
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 1301 transition count 1763
Applied a total of 153 rules in 176 ms. Remains 1301 /1364 variables (removed 63) and now considering 1763/1853 (removed 90) transitions.
// Phase 1: matrix 1763 rows 1301 cols
[2023-03-22 19:40:31] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-22 19:40:32] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-22 19:40:32] [INFO ] Invariant cache hit.
[2023-03-22 19:40:33] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-22 19:40:33] [INFO ] Invariant cache hit.
[2023-03-22 19:40:34] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1301/1364 places, 1763/1853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2642 ms. Remains : 1301/1364 places, 1763/1853 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (EQ s945 1) (OR (EQ s972 0) (EQ s939 1))), p1:(AND (EQ s945 0) (OR (EQ s1136 0) (EQ s489 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-07 finished in 2911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 1364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Graph (trivial) has 1298 edges and 1364 vertex of which 121 / 1364 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 1262 transition count 1646
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 1158 transition count 1646
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 209 place count 1158 transition count 1596
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 309 place count 1108 transition count 1596
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 380 place count 1037 transition count 1525
Iterating global reduction 2 with 71 rules applied. Total rules applied 451 place count 1037 transition count 1525
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 458 place count 1037 transition count 1518
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 458 place count 1037 transition count 1516
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 462 place count 1035 transition count 1516
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 478 place count 1019 transition count 1500
Iterating global reduction 3 with 16 rules applied. Total rules applied 494 place count 1019 transition count 1500
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 508 place count 1019 transition count 1486
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 752 place count 897 transition count 1364
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 756 place count 893 transition count 1360
Iterating global reduction 4 with 4 rules applied. Total rules applied 760 place count 893 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 764 place count 893 transition count 1356
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 784 place count 893 transition count 1336
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 786 place count 891 transition count 1334
Applied a total of 786 rules in 440 ms. Remains 891 /1364 variables (removed 473) and now considering 1334/1853 (removed 519) transitions.
[2023-03-22 19:40:35] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
// Phase 1: matrix 1295 rows 891 cols
[2023-03-22 19:40:35] [INFO ] Computed 22 place invariants in 39 ms
[2023-03-22 19:40:35] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-22 19:40:35] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
[2023-03-22 19:40:35] [INFO ] Invariant cache hit.
[2023-03-22 19:40:36] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2023-03-22 19:40:36] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 19:40:36] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
[2023-03-22 19:40:36] [INFO ] Invariant cache hit.
[2023-03-22 19:40:37] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 891/1364 places, 1334/1853 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2483 ms. Remains : 891/1364 places, 1334/1853 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-08 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 (EQ s14 0) (EQ s212 1) (EQ s0 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-08 finished in 2577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F(p1)))))'
Support contains 4 out of 1364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1330 transition count 1819
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1330 transition count 1819
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 1330 transition count 1811
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 1305 transition count 1786
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 1305 transition count 1786
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 139 place count 1305 transition count 1773
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 148 place count 1296 transition count 1764
Iterating global reduction 2 with 9 rules applied. Total rules applied 157 place count 1296 transition count 1764
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 162 place count 1296 transition count 1759
Applied a total of 162 rules in 191 ms. Remains 1296 /1364 variables (removed 68) and now considering 1759/1853 (removed 94) transitions.
// Phase 1: matrix 1759 rows 1296 cols
[2023-03-22 19:40:37] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-22 19:40:37] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-22 19:40:37] [INFO ] Invariant cache hit.
[2023-03-22 19:40:39] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2023-03-22 19:40:39] [INFO ] Invariant cache hit.
[2023-03-22 19:40:39] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1296/1364 places, 1759/1853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2602 ms. Remains : 1296/1364 places, 1759/1853 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s69 0) (NEQ s464 1)), p1:(OR (EQ s839 0) (EQ s676 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-10 finished in 2809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U (!p2&&(!p3 U (p4||G(!p3)))))))'
Support contains 9 out of 1364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Graph (trivial) has 1290 edges and 1364 vertex of which 121 / 1364 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 1262 transition count 1650
Reduce places removed 100 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 1162 transition count 1649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 203 place count 1161 transition count 1649
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 203 place count 1161 transition count 1598
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 305 place count 1110 transition count 1598
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 373 place count 1042 transition count 1530
Iterating global reduction 3 with 68 rules applied. Total rules applied 441 place count 1042 transition count 1530
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 446 place count 1042 transition count 1525
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 446 place count 1042 transition count 1524
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 448 place count 1041 transition count 1524
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 462 place count 1027 transition count 1510
Iterating global reduction 4 with 14 rules applied. Total rules applied 476 place count 1027 transition count 1510
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 489 place count 1027 transition count 1497
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 735 place count 904 transition count 1374
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 740 place count 899 transition count 1369
Iterating global reduction 5 with 5 rules applied. Total rules applied 745 place count 899 transition count 1369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 750 place count 899 transition count 1364
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 770 place count 899 transition count 1344
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 772 place count 897 transition count 1342
Applied a total of 772 rules in 440 ms. Remains 897 /1364 variables (removed 467) and now considering 1342/1853 (removed 511) transitions.
[2023-03-22 19:40:40] [INFO ] Flow matrix only has 1303 transitions (discarded 39 similar events)
// Phase 1: matrix 1303 rows 897 cols
[2023-03-22 19:40:40] [INFO ] Computed 22 place invariants in 34 ms
[2023-03-22 19:40:40] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-22 19:40:40] [INFO ] Flow matrix only has 1303 transitions (discarded 39 similar events)
[2023-03-22 19:40:40] [INFO ] Invariant cache hit.
[2023-03-22 19:40:41] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2023-03-22 19:40:41] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-22 19:40:41] [INFO ] Flow matrix only has 1303 transitions (discarded 39 similar events)
[2023-03-22 19:40:41] [INFO ] Invariant cache hit.
[2023-03-22 19:40:42] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 897/1364 places, 1342/1853 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2362 ms. Remains : 897/1364 places, 1342/1853 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR p2 (AND p3 (NOT p4))), true, (NOT p0), (AND (NOT p4) p3), (OR p2 (AND p3 (NOT p4))), (AND (NOT p0) (NOT p4) p3 p1), (AND p3 (NOT p4)), (AND p3 (NOT p4))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND (NOT p4) p3 p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND (NOT p4) p3 (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p1) p0) (AND (NOT p4) p3 (NOT p1) p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 p1 (NOT p0)) (AND (NOT p4) p3 p1 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p4) p3 (NOT p1))), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p1) (AND (NOT p4) p3 p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p4) (NOT p3) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p4) p3 p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p4) p3 p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p4) (NOT p3) p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p4) p3 p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p4) p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p1) p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p4) p3 p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p4) (NOT p3) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p4) (NOT p3) p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p4) p3 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p4) p3 p1), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p4) (NOT p3) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s262 0) (EQ s140 1)), p0:(EQ s448 1), p4:(AND (NOT (OR (EQ s893 0) (EQ s694 1))) (NOT (OR (EQ s319 0) (EQ s272 1)))), p3:(OR (EQ s319 0) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-11 finished in 2774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Graph (trivial) has 1299 edges and 1364 vertex of which 121 / 1364 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1262 transition count 1647
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1159 transition count 1647
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 207 place count 1159 transition count 1596
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 309 place count 1108 transition count 1596
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 382 place count 1035 transition count 1523
Iterating global reduction 2 with 73 rules applied. Total rules applied 455 place count 1035 transition count 1523
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 462 place count 1035 transition count 1516
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 462 place count 1035 transition count 1514
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 466 place count 1033 transition count 1514
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 482 place count 1017 transition count 1498
Iterating global reduction 3 with 16 rules applied. Total rules applied 498 place count 1017 transition count 1498
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 513 place count 1017 transition count 1483
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 757 place count 895 transition count 1361
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 762 place count 890 transition count 1356
Iterating global reduction 4 with 5 rules applied. Total rules applied 767 place count 890 transition count 1356
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 772 place count 890 transition count 1351
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 792 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 794 place count 888 transition count 1329
Applied a total of 794 rules in 452 ms. Remains 888 /1364 variables (removed 476) and now considering 1329/1853 (removed 524) transitions.
[2023-03-22 19:40:43] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
// Phase 1: matrix 1290 rows 888 cols
[2023-03-22 19:40:43] [INFO ] Computed 22 place invariants in 35 ms
[2023-03-22 19:40:43] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-22 19:40:43] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:40:43] [INFO ] Invariant cache hit.
[2023-03-22 19:40:44] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2023-03-22 19:40:44] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-22 19:40:44] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:40:44] [INFO ] Invariant cache hit.
[2023-03-22 19:40:45] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 888/1364 places, 1329/1853 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2395 ms. Remains : 888/1364 places, 1329/1853 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-12 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:(OR (EQ s261 0) (EQ s447 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3772 reset in 1200 ms.
Product exploration explored 100000 steps with 3767 reset in 1187 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 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 385 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 479521 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 479521 steps, saw 120773 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:40:51] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:40:51] [INFO ] Invariant cache hit.
[2023-03-22 19:40:51] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:40:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2023-03-22 19:40:51] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:40:51] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 19:40:52] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 888 transition count 1289
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 868 transition count 1269
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 868 transition count 1269
Free-agglomeration rule applied 763 times.
Iterating global reduction 1 with 763 rules applied. Total rules applied 843 place count 868 transition count 506
Discarding 80 places :
Also discarding 337 output transitions
Drop transitions removed 337 transitions
Remove reverse transitions (loop back) rule discarded transition t390.t1413.t1266 and 80 places that fell out of Prefix Of Interest.
Drop transitions removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (trivial) has 28 edges and 23 vertex of which 20 / 23 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 138 rules applied. Total rules applied 981 place count 7 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1011 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1011 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1013 place count 4 transition count 4
Applied a total of 1013 rules in 134 ms. Remains 4 /888 variables (removed 884) and now considering 4/1329 (removed 1325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 4/888 places, 4/1329 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Applied a total of 0 rules in 80 ms. Remains 888 /888 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2023-03-22 19:40:52] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:40:52] [INFO ] Invariant cache hit.
[2023-03-22 19:40:53] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-22 19:40:53] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:40:53] [INFO ] Invariant cache hit.
[2023-03-22 19:40:54] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
[2023-03-22 19:40:54] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-22 19:40:54] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:40:54] [INFO ] Invariant cache hit.
[2023-03-22 19:40:54] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1980 ms. Remains : 888/888 places, 1329/1329 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 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 385 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 485284 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485284 steps, saw 121710 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:40:58] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:40:58] [INFO ] Invariant cache hit.
[2023-03-22 19:40:58] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:40:58] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-22 19:40:58] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:40:58] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-22 19:40:58] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 888 transition count 1289
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 868 transition count 1269
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 868 transition count 1269
Free-agglomeration rule applied 763 times.
Iterating global reduction 1 with 763 rules applied. Total rules applied 843 place count 868 transition count 506
Discarding 80 places :
Also discarding 337 output transitions
Drop transitions removed 337 transitions
Remove reverse transitions (loop back) rule discarded transition t390.t1413.t1266 and 80 places that fell out of Prefix Of Interest.
Drop transitions removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (trivial) has 28 edges and 23 vertex of which 20 / 23 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 138 rules applied. Total rules applied 981 place count 7 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1011 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1011 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1013 place count 4 transition count 4
Applied a total of 1013 rules in 120 ms. Remains 4 /888 variables (removed 884) and now considering 4/1329 (removed 1325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 4/888 places, 4/1329 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3777 reset in 1081 ms.
Product exploration explored 100000 steps with 3779 reset in 1100 ms.
Built C files in :
/tmp/ltsmin11962862093473695280
[2023-03-22 19:41:01] [INFO ] Computing symmetric may disable matrix : 1329 transitions.
[2023-03-22 19:41:01] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 19:41:01] [INFO ] Computing symmetric may enable matrix : 1329 transitions.
[2023-03-22 19:41:02] [INFO ] Computation of Complete enable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 19:41:02] [INFO ] Computing Do-Not-Accords matrix : 1329 transitions.
[2023-03-22 19:41:02] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 19:41:02] [INFO ] Built C files in 490ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11962862093473695280
Running compilation step : cd /tmp/ltsmin11962862093473695280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11962862093473695280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11962862093473695280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Applied a total of 0 rules in 109 ms. Remains 888 /888 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2023-03-22 19:41:05] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:41:05] [INFO ] Invariant cache hit.
[2023-03-22 19:41:06] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-22 19:41:06] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:41:06] [INFO ] Invariant cache hit.
[2023-03-22 19:41:07] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2023-03-22 19:41:07] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 19:41:07] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-22 19:41:07] [INFO ] Invariant cache hit.
[2023-03-22 19:41:07] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2231 ms. Remains : 888/888 places, 1329/1329 transitions.
Built C files in :
/tmp/ltsmin1711665476466644893
[2023-03-22 19:41:07] [INFO ] Computing symmetric may disable matrix : 1329 transitions.
[2023-03-22 19:41:07] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 19:41:07] [INFO ] Computing symmetric may enable matrix : 1329 transitions.
[2023-03-22 19:41:07] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 19:41:08] [INFO ] Computing Do-Not-Accords matrix : 1329 transitions.
[2023-03-22 19:41:08] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 19:41:08] [INFO ] Built C files in 426ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1711665476466644893
Running compilation step : cd /tmp/ltsmin1711665476466644893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1711665476466644893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1711665476466644893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 19:41:11] [INFO ] Flatten gal took : 57 ms
[2023-03-22 19:41:11] [INFO ] Flatten gal took : 30 ms
[2023-03-22 19:41:11] [INFO ] Time to serialize gal into /tmp/LTL6732606551396673530.gal : 23 ms
[2023-03-22 19:41:11] [INFO ] Time to serialize properties into /tmp/LTL12938662059912567733.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6732606551396673530.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13788067685421431854.hoa' '-atoms' '/tmp/LTL12938662059912567733.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12938662059912567733.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13788067685421431854.hoa
Detected timeout of ITS tools.
[2023-03-22 19:41:26] [INFO ] Flatten gal took : 29 ms
[2023-03-22 19:41:26] [INFO ] Flatten gal took : 47 ms
[2023-03-22 19:41:26] [INFO ] Time to serialize gal into /tmp/LTL13279446312370153243.gal : 6 ms
[2023-03-22 19:41:26] [INFO ] Time to serialize properties into /tmp/LTL11309588596660097213.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13279446312370153243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11309588596660097213.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p1858==0)||(p3165==1))"))))
Formula 0 simplified : FG!"((p1858==0)||(p3165==1))"
Detected timeout of ITS tools.
[2023-03-22 19:41:41] [INFO ] Flatten gal took : 29 ms
[2023-03-22 19:41:41] [INFO ] Applying decomposition
[2023-03-22 19:41:41] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4928151831962714495.txt' '-o' '/tmp/graph4928151831962714495.bin' '-w' '/tmp/graph4928151831962714495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4928151831962714495.bin' '-l' '-1' '-v' '-w' '/tmp/graph4928151831962714495.weights' '-q' '0' '-e' '0.001'
[2023-03-22 19:41:41] [INFO ] Decomposing Gal with order
[2023-03-22 19:41:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 19:41:42] [INFO ] Removed a total of 523 redundant transitions.
[2023-03-22 19:41:42] [INFO ] Flatten gal took : 144 ms
[2023-03-22 19:41:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 28 ms.
[2023-03-22 19:41:42] [INFO ] Time to serialize gal into /tmp/LTL13333791558907677064.gal : 21 ms
[2023-03-22 19:41:42] [INFO ] Time to serialize properties into /tmp/LTL4701015374990646413.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13333791558907677064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4701015374990646413.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i10.u30.p1858==0)||(u54.p3165==1))"))))
Formula 0 simplified : FG!"((i10.u30.p1858==0)||(u54.p3165==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3546833346904346988
[2023-03-22 19:41:57] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3546833346904346988
Running compilation step : cd /tmp/ltsmin3546833346904346988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2197 ms.
Running link step : cd /tmp/ltsmin3546833346904346988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3546833346904346988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-12 finished in 89748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 4 out of 1364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1332 transition count 1821
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1332 transition count 1821
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 71 place count 1332 transition count 1814
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 96 place count 1307 transition count 1789
Iterating global reduction 1 with 25 rules applied. Total rules applied 121 place count 1307 transition count 1789
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 134 place count 1307 transition count 1776
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 143 place count 1298 transition count 1767
Iterating global reduction 2 with 9 rules applied. Total rules applied 152 place count 1298 transition count 1767
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 158 place count 1298 transition count 1761
Applied a total of 158 rules in 161 ms. Remains 1298 /1364 variables (removed 66) and now considering 1761/1853 (removed 92) transitions.
// Phase 1: matrix 1761 rows 1298 cols
[2023-03-22 19:42:12] [INFO ] Computed 22 place invariants in 25 ms
[2023-03-22 19:42:13] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-22 19:42:13] [INFO ] Invariant cache hit.
[2023-03-22 19:42:14] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2023-03-22 19:42:14] [INFO ] Invariant cache hit.
[2023-03-22 19:42:15] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1298/1364 places, 1761/1853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2547 ms. Remains : 1298/1364 places, 1761/1853 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s39 0) (EQ s676 1)), p1:(AND (EQ s334 0) (EQ s1084 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-13 finished in 2745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F(!p1)))))'
Support contains 4 out of 1364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1364/1364 places, 1853/1853 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1332 transition count 1821
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1332 transition count 1821
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 70 place count 1332 transition count 1815
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 96 place count 1306 transition count 1789
Iterating global reduction 1 with 26 rules applied. Total rules applied 122 place count 1306 transition count 1789
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 134 place count 1306 transition count 1777
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 145 place count 1295 transition count 1766
Iterating global reduction 2 with 11 rules applied. Total rules applied 156 place count 1295 transition count 1766
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 163 place count 1295 transition count 1759
Applied a total of 163 rules in 153 ms. Remains 1295 /1364 variables (removed 69) and now considering 1759/1853 (removed 94) transitions.
// Phase 1: matrix 1759 rows 1295 cols
[2023-03-22 19:42:15] [INFO ] Computed 22 place invariants in 24 ms
[2023-03-22 19:42:15] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-22 19:42:15] [INFO ] Invariant cache hit.
[2023-03-22 19:42:17] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2023-03-22 19:42:17] [INFO ] Invariant cache hit.
[2023-03-22 19:42:17] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1295/1364 places, 1759/1853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2591 ms. Remains : 1295/1364 places, 1759/1853 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s799 0) (EQ s1252 1)), p0:(OR (EQ s628 0) (EQ s492 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLCardinality-15 finished in 2803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-22 19:42:18] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1672068448842308005
[2023-03-22 19:42:18] [INFO ] Too many transitions (1853) to apply POR reductions. Disabling POR matrices.
[2023-03-22 19:42:18] [INFO ] Applying decomposition
[2023-03-22 19:42:18] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1672068448842308005
Running compilation step : cd /tmp/ltsmin1672068448842308005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-22 19:42:18] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6026293654193326211.txt' '-o' '/tmp/graph6026293654193326211.bin' '-w' '/tmp/graph6026293654193326211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6026293654193326211.bin' '-l' '-1' '-v' '-w' '/tmp/graph6026293654193326211.weights' '-q' '0' '-e' '0.001'
[2023-03-22 19:42:18] [INFO ] Decomposing Gal with order
[2023-03-22 19:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 19:42:18] [INFO ] Removed a total of 551 redundant transitions.
[2023-03-22 19:42:19] [INFO ] Flatten gal took : 283 ms
[2023-03-22 19:42:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 66 ms.
[2023-03-22 19:42:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality14772332933199413192.gal : 30 ms
[2023-03-22 19:42:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality7660141173378250924.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14772332933199413192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7660141173378250924.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(X("((i5.u44.p604==0)||(i14.u153.p2423==1))")))))
Formula 0 simplified : XXX!"((i5.u44.p604==0)||(i14.u153.p2423==1))"
Compilation finished in 3659 ms.
Running link step : cd /tmp/ltsmin1672068448842308005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1672068448842308005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 3390 ms.
FORMULA FlexibleBarrier-PT-20b-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1672068448842308005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-22 20:03:27] [INFO ] Applying decomposition
[2023-03-22 20:03:28] [INFO ] Flatten gal took : 112 ms
[2023-03-22 20:03:28] [INFO ] Decomposing Gal with order
[2023-03-22 20:03:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 20:03:28] [INFO ] Removed a total of 519 redundant transitions.
[2023-03-22 20:03:28] [INFO ] Flatten gal took : 397 ms
[2023-03-22 20:03:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1801 labels/synchronizations in 673 ms.
[2023-03-22 20:03:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality13142483820844558140.gal : 60 ms
[2023-03-22 20:03:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality9574291601946243302.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13142483820844558140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9574291601946243302.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u30.p1858==0)||(i0.i0.i0.u37.p3165==1))"))))
Formula 0 simplified : FG!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u30.p1858==0)||(i0.i0.i0.u37.p3165==1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin1672068448842308005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin1672068448842308005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-22 20:24:40] [INFO ] Flatten gal took : 510 ms
[2023-03-22 20:24:42] [INFO ] Input system was already deterministic with 1853 transitions.
[2023-03-22 20:24:43] [INFO ] Transformed 1364 places.
[2023-03-22 20:24:43] [INFO ] Transformed 1853 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-22 20:24:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality12105494408652087855.gal : 29 ms
[2023-03-22 20:24:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality10469509082471481872.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12105494408652087855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10469509082471481872.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p1858==0)||(p3165==1))"))))
Formula 0 simplified : FG!"((p1858==0)||(p3165==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7324096 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15291180 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-20b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850600579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-PT-20b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;