About the Execution of ITS-Tools for ShieldPPPs-PT-003B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16242.132 | 3600000.00 | 7845578.00 | 182203.10 | T?TF?FFFFFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205300557.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205300557
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 12:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 52K May 5 16:52 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 ShieldPPPs-PT-003B-00
FORMULA_NAME ShieldPPPs-PT-003B-01
FORMULA_NAME ShieldPPPs-PT-003B-02
FORMULA_NAME ShieldPPPs-PT-003B-03
FORMULA_NAME ShieldPPPs-PT-003B-04
FORMULA_NAME ShieldPPPs-PT-003B-05
FORMULA_NAME ShieldPPPs-PT-003B-06
FORMULA_NAME ShieldPPPs-PT-003B-07
FORMULA_NAME ShieldPPPs-PT-003B-08
FORMULA_NAME ShieldPPPs-PT-003B-09
FORMULA_NAME ShieldPPPs-PT-003B-10
FORMULA_NAME ShieldPPPs-PT-003B-11
FORMULA_NAME ShieldPPPs-PT-003B-12
FORMULA_NAME ShieldPPPs-PT-003B-13
FORMULA_NAME ShieldPPPs-PT-003B-14
FORMULA_NAME ShieldPPPs-PT-003B-15
=== Now, execution of the tool begins
BK_START 1621124681055
Running Version 0
[2021-05-16 00:24:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 00:24:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 00:24:42] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-16 00:24:42] [INFO ] Transformed 207 places.
[2021-05-16 00:24:42] [INFO ] Transformed 192 transitions.
[2021-05-16 00:24:42] [INFO ] Found NUPN structural information;
[2021-05-16 00:24:42] [INFO ] Parsed PT model containing 207 places and 192 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 00:24:42] [INFO ] Initial state test concluded for 4 properties.
FORMULA ShieldPPPs-PT-003B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 188 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 188 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 187 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 187 transition count 172
Applied a total of 40 rules in 43 ms. Remains 187 /207 variables (removed 20) and now considering 172/192 (removed 20) transitions.
// Phase 1: matrix 172 rows 187 cols
[2021-05-16 00:24:42] [INFO ] Computed 34 place invariants in 17 ms
[2021-05-16 00:24:43] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 172 rows 187 cols
[2021-05-16 00:24:43] [INFO ] Computed 34 place invariants in 3 ms
[2021-05-16 00:24:43] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 187 cols
[2021-05-16 00:24:43] [INFO ] Computed 34 place invariants in 5 ms
[2021-05-16 00:24:43] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 187/207 places, 172/192 transitions.
[2021-05-16 00:24:43] [INFO ] Flatten gal took : 46 ms
[2021-05-16 00:24:43] [INFO ] Flatten gal took : 17 ms
[2021-05-16 00:24:43] [INFO ] Input system was already deterministic with 172 transitions.
Finished random walk after 668 steps, including 0 resets, run visited all 24 properties in 12 ms. (steps per millisecond=55 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 11 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:24:43] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:24:43] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:24:43] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:24:43] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:24:43] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-16 00:24:43] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (NEQ s94 1) (NEQ s122 1)), p0:(OR (NEQ s95 1) (NEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 185/185 places, 170/170 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 185 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 22 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 90 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 113 place count 162 transition count 148
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 136 place count 162 transition count 148
Deduced a syphon composed of 67 places in 0 ms
Applied a total of 136 rules in 34 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2021-05-16 00:24:45] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 148 rows 162 cols
[2021-05-16 00:24:45] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:24:45] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/185 places, 148/170 transitions.
Product exploration explored 100000 steps with 50000 reset in 738 ms.
Product exploration explored 100000 steps with 50000 reset in 601 ms.
[2021-05-16 00:24:46] [INFO ] Flatten gal took : 10 ms
[2021-05-16 00:24:46] [INFO ] Flatten gal took : 10 ms
[2021-05-16 00:24:46] [INFO ] Time to serialize gal into /tmp/LTL6237283418702632515.gal : 4 ms
[2021-05-16 00:24:46] [INFO ] Time to serialize properties into /tmp/LTL4537684238577923592.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6237283418702632515.gal, -t, CGAL, -LTL, /tmp/LTL4537684238577923592.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6237283418702632515.gal -t CGAL -LTL /tmp/LTL4537684238577923592.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p102!=1)||(p104!=1))")||(G("((p101!=1)||(p134!=1))"))))))
Formula 0 simplified : !XF("((p102!=1)||(p104!=1))" | G"((p101!=1)||(p134!=1))")
Detected timeout of ITS tools.
[2021-05-16 00:25:01] [INFO ] Flatten gal took : 13 ms
[2021-05-16 00:25:01] [INFO ] Applying decomposition
[2021-05-16 00:25:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9272077198215193787.txt, -o, /tmp/graph9272077198215193787.bin, -w, /tmp/graph9272077198215193787.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9272077198215193787.bin, -l, -1, -v, -w, /tmp/graph9272077198215193787.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:25:01] [INFO ] Decomposing Gal with order
[2021-05-16 00:25:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:25:01] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-16 00:25:01] [INFO ] Flatten gal took : 41 ms
[2021-05-16 00:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-16 00:25:02] [INFO ] Time to serialize gal into /tmp/LTL10368421013297856635.gal : 8 ms
[2021-05-16 00:25:02] [INFO ] Time to serialize properties into /tmp/LTL14290012209416708178.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10368421013297856635.gal, -t, CGAL, -LTL, /tmp/LTL14290012209416708178.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10368421013297856635.gal -t CGAL -LTL /tmp/LTL14290012209416708178.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("((i7.i0.u37.p102!=1)||(i7.i0.u38.p104!=1))")||(G("((i7.i0.u37.p101!=1)||(i7.i1.u47.p134!=1))"))))))
Formula 0 simplified : !XF("((i7.i0.u37.p102!=1)||(i7.i0.u38.p104!=1))" | G"((i7.i0.u37.p101!=1)||(i7.i1.u47.p134!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11679903789910667355
[2021-05-16 00:25:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11679903789910667355
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11679903789910667355]
Compilation finished in 735 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11679903789910667355]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp1==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11679903789910667355]
LTSmin run took 226 ms.
FORMULA ShieldPPPs-PT-003B-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-00 finished in 34435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 146 transition count 130
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 145 transition count 130
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 96 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 28 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:25:18] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:25:18] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:25:18] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:25:18] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2021-05-16 00:25:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:25:18] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-16 00:25:18] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-003B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s34 1), p1:(NEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 437 reset in 232 ms.
Product exploration explored 100000 steps with 444 reset in 283 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 434 reset in 203 ms.
Product exploration explored 100000 steps with 435 reset in 227 ms.
[2021-05-16 00:25:19] [INFO ] Flatten gal took : 5 ms
[2021-05-16 00:25:19] [INFO ] Flatten gal took : 5 ms
[2021-05-16 00:25:19] [INFO ] Time to serialize gal into /tmp/LTL3606752777525892375.gal : 2 ms
[2021-05-16 00:25:19] [INFO ] Time to serialize properties into /tmp/LTL14040996776118432541.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3606752777525892375.gal, -t, CGAL, -LTL, /tmp/LTL14040996776118432541.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3606752777525892375.gal -t CGAL -LTL /tmp/LTL14040996776118432541.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p80!=1)")||(F("(p67!=1)"))))))
Formula 0 simplified : !FG("(p80!=1)" | F"(p67!=1)")
Reverse transition relation is NOT exact ! Due to transitions t0.t117, t1.t114, t2.t111, t4, t6, t8, t9, t11, t12, t13.t90, t14.t87, t15.t84, t17, t18, t20, t21, t23, t24, t25.t62, t26.t59, t29, t30, t32, t33, t35, t36, t85, t88, t162.t3, t164.t3, t158.t7, t160.t7, t168.t10, t170.t10, t147.t16, t149.t16, t143.t19, t145.t19, t153.t22, t155.t22, t27.t56.t120.t55, t132.t28, t134.t28, t128.t31, t130.t31, t138.t34, t140.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/33/47/80
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
[2021-05-16 00:25:34] [INFO ] Flatten gal took : 10 ms
[2021-05-16 00:25:34] [INFO ] Applying decomposition
[2021-05-16 00:25:34] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12166577603366954910.txt, -o, /tmp/graph12166577603366954910.bin, -w, /tmp/graph12166577603366954910.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12166577603366954910.bin, -l, -1, -v, -w, /tmp/graph12166577603366954910.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:25:34] [INFO ] Decomposing Gal with order
[2021-05-16 00:25:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:25:34] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-16 00:25:34] [INFO ] Flatten gal took : 9 ms
[2021-05-16 00:25:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2021-05-16 00:25:34] [INFO ] Time to serialize gal into /tmp/LTL9610186510695780073.gal : 2 ms
[2021-05-16 00:25:34] [INFO ] Time to serialize properties into /tmp/LTL17485452926252146244.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9610186510695780073.gal, -t, CGAL, -LTL, /tmp/LTL17485452926252146244.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9610186510695780073.gal -t CGAL -LTL /tmp/LTL17485452926252146244.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i4.i0.u12.p80!=1)")||(F("(i0.i1.u11.p67!=1)"))))))
Formula 0 simplified : !FG("(i4.i0.u12.p80!=1)" | F"(i0.i1.u11.p67!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14195510850434743223
[2021-05-16 00:25:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14195510850434743223
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14195510850434743223]
Compilation finished in 378 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14195510850434743223]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([](((LTLAPp0==true)||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14195510850434743223]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-01 finished in 46516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||X(X((p1&&(p1 U p2))))||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 171
Applied a total of 2 rules in 6 ms. Remains 186 /187 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:26:04] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:26:04] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:26:04] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-16 00:26:04] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:26:04] [INFO ] Computed 34 place invariants in 8 ms
[2021-05-16 00:26:04] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 186/187 places, 171/172 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldPPPs-PT-003B-02 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 1}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={} source=9 dest: 10}], [{ cond=true, acceptance={} source=10 dest: 3}]], initial=9, aps=[p1:(EQ s43 1), p2:(EQ s18 1), p3:(EQ s124 1), p0:(EQ s124 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Knowledge obtained : [(NOT p1), (NOT p2), (NOT p3), p0]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Applying partial POR strategy [true, true, true, false, false, true, true, false, true, false, false]
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Support contains 3 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 186/186 places, 171/171 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 186 transition count 171
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 21 place count 186 transition count 172
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 186 transition count 172
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 90 place count 186 transition count 172
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 113 place count 163 transition count 149
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 136 place count 163 transition count 149
Deduced a syphon composed of 67 places in 0 ms
Applied a total of 136 rules in 31 ms. Remains 163 /186 variables (removed 23) and now considering 149/171 (removed 22) transitions.
[2021-05-16 00:26:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 149 rows 163 cols
[2021-05-16 00:26:06] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-16 00:26:06] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/186 places, 149/171 transitions.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Product exploration explored 100000 steps with 33333 reset in 173 ms.
[2021-05-16 00:26:06] [INFO ] Flatten gal took : 8 ms
[2021-05-16 00:26:06] [INFO ] Flatten gal took : 8 ms
[2021-05-16 00:26:06] [INFO ] Time to serialize gal into /tmp/LTL14400661184208649881.gal : 1 ms
[2021-05-16 00:26:06] [INFO ] Time to serialize properties into /tmp/LTL6994595472787656938.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14400661184208649881.gal, -t, CGAL, -LTL, /tmp/LTL6994595472787656938.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14400661184208649881.gal -t CGAL -LTL /tmp/LTL6994595472787656938.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((("(p136==0)")||(X(X(("(p43==1)")&&(("(p43==1)")U("(p18==1)"))))))||(G("(p136==1)"))))))
Formula 0 simplified : !XX("(p136==0)" | XX("(p43==1)" & ("(p43==1)" U "(p18==1)")) | G"(p136==1)")
Detected timeout of ITS tools.
[2021-05-16 00:26:21] [INFO ] Flatten gal took : 6 ms
[2021-05-16 00:26:21] [INFO ] Applying decomposition
[2021-05-16 00:26:21] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17864183123969087760.txt, -o, /tmp/graph17864183123969087760.bin, -w, /tmp/graph17864183123969087760.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17864183123969087760.bin, -l, -1, -v, -w, /tmp/graph17864183123969087760.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:26:21] [INFO ] Decomposing Gal with order
[2021-05-16 00:26:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:26:21] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-16 00:26:21] [INFO ] Flatten gal took : 13 ms
[2021-05-16 00:26:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 00:26:21] [INFO ] Time to serialize gal into /tmp/LTL4146038858611292747.gal : 3 ms
[2021-05-16 00:26:21] [INFO ] Time to serialize properties into /tmp/LTL15646528657006679195.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4146038858611292747.gal, -t, CGAL, -LTL, /tmp/LTL15646528657006679195.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4146038858611292747.gal -t CGAL -LTL /tmp/LTL15646528657006679195.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((("(i6.u48.p136==0)")||(X(X(("(i2.i1.u17.p43==1)")&&(("(i2.i1.u17.p43==1)")U("(i2.i0.u7.p18==1)"))))))||(G("(i6.u48.p136==1)"))))))
Formula 0 simplified : !XX("(i6.u48.p136==0)" | XX("(i2.i1.u17.p43==1)" & ("(i2.i1.u17.p43==1)" U "(i2.i0.u7.p18==1)")) | G"(i6.u48.p136==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1054500195591448846
[2021-05-16 00:26:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1054500195591448846
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1054500195591448846]
Compilation finished in 682 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1054500195591448846]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)||X(X(((LTLAPp1==true)&&((LTLAPp1==true) U (LTLAPp2==true)))))||[]((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin1054500195591448846]
LTSmin run took 357 ms.
FORMULA ShieldPPPs-PT-003B-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-02 finished in 33490 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 147 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 147 transition count 132
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
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 180 place count 96 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 95 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 94 transition count 79
Applied a total of 182 rules in 19 ms. Remains 94 /187 variables (removed 93) and now considering 79/172 (removed 93) transitions.
// Phase 1: matrix 79 rows 94 cols
[2021-05-16 00:26:38] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:26:38] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 79 rows 94 cols
[2021-05-16 00:26:38] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:26:38] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2021-05-16 00:26:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 94 cols
[2021-05-16 00:26:38] [INFO ] Computed 34 place invariants in 6 ms
[2021-05-16 00:26:38] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/187 places, 79/172 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-003B-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s56 1), p0:(EQ s27 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4531 reset in 185 ms.
Product exploration explored 100000 steps with 4541 reset in 186 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4526 reset in 169 ms.
Product exploration explored 100000 steps with 4504 reset in 186 ms.
[2021-05-16 00:26:39] [INFO ] Flatten gal took : 3 ms
[2021-05-16 00:26:39] [INFO ] Flatten gal took : 3 ms
[2021-05-16 00:26:39] [INFO ] Time to serialize gal into /tmp/LTL1817697813785261190.gal : 1 ms
[2021-05-16 00:26:39] [INFO ] Time to serialize properties into /tmp/LTL2703487859967059577.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1817697813785261190.gal, -t, CGAL, -LTL, /tmp/LTL2703487859967059577.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1817697813785261190.gal -t CGAL -LTL /tmp/LTL2703487859967059577.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p56==0)")U("(p120==1)")))))
Formula 0 simplified : !FG("(p56==0)" U "(p120==1)")
Reverse transition relation is NOT exact ! Due to transitions t0.t117, t1.t114, t2.t111, t4, t6, t8, t9, t11, t12, t13.t90, t14.t87, t15.t84, t17, t18, t20, t21, t23, t24, t25.t62, t26.t59, t29, t30, t32, t33, t35, t36, t75, t162.t3, t164.t3, t158.t7, t160.t7, t168.t10, t170.t10, t147.t16, t149.t16, t143.t19, t145.t19, t153.t22, t155.t22, t27.t56.t120.t55, t132.t28, t134.t28, t128.t31, t130.t31, t138.t34, t140.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/33/46/79
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
[2021-05-16 00:26:54] [INFO ] Flatten gal took : 4 ms
[2021-05-16 00:26:54] [INFO ] Applying decomposition
[2021-05-16 00:26:54] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10178840803350117794.txt, -o, /tmp/graph10178840803350117794.bin, -w, /tmp/graph10178840803350117794.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10178840803350117794.bin, -l, -1, -v, -w, /tmp/graph10178840803350117794.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:26:54] [INFO ] Decomposing Gal with order
[2021-05-16 00:26:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:26:54] [INFO ] Removed a total of 19 redundant transitions.
[2021-05-16 00:26:54] [INFO ] Flatten gal took : 7 ms
[2021-05-16 00:26:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 1 ms.
[2021-05-16 00:26:54] [INFO ] Time to serialize gal into /tmp/LTL7620796817906205710.gal : 1 ms
[2021-05-16 00:26:54] [INFO ] Time to serialize properties into /tmp/LTL5700904214876475132.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7620796817906205710.gal, -t, CGAL, -LTL, /tmp/LTL5700904214876475132.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7620796817906205710.gal -t CGAL -LTL /tmp/LTL5700904214876475132.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i2.u10.p56==0)")U("(i5.u22.p120==1)")))))
Formula 0 simplified : !FG("(i2.u10.p56==0)" U "(i5.u22.p120==1)")
Reverse transition relation is NOT exact ! Due to transitions t0_t117, t1_t114, t2_t111, t13_t90, t14_t87, t15_t84, t25_t62, t26_t59, t27_t56_t120_t55, i0.i1.t168_t10, i0.i1.t170_t10, i0.i1.u11.t11, i0.i1.u11.t12, i1.t164_t3, i1.t108_t107_t163, i1.u8.t4, i1.u8.t6, i2.t158_t7, i2.t102_t101_t157, i2.u10.t8, i2.u10.t9, i3.t81_t80_t148, i3.t81_t80_t146, i3.u19.t17, i3.u19.t18, i4.i1.t70_t68_t154, i4.i1.t153_t22, i4.i1.u23.t23, i4.i1.u23.t24, i5.t145_t19, i5.t143_t19, i5.u21.t20, i5.u21.t21, i5.u22.t75, i6.t128_t31, i6.t47_t46_t127, i6.u33.t32, i6.u33.t33, i7.t134_t28, i7.t132_t28, i7.u31.t29, i7.u31.t30, i8.i1.t43_t41_t139, i8.i1.t138_t34, i8.i1.u34.t35, i8.i1.u34.t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/46/63
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17865096270879984563
[2021-05-16 00:27:09] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17865096270879984563
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17865096270879984563]
Compilation finished in 354 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17865096270879984563]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([](((LTLAPp0==true) U (LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17865096270879984563]
LTSmin run took 2904 ms.
FORMULA ShieldPPPs-PT-003B-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-03 finished in 34608 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(F(p1))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 171
Applied a total of 2 rules in 4 ms. Remains 186 /187 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:27:12] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:27:12] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:27:12] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:27:12] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:27:12] [INFO ] Computed 34 place invariants in 13 ms
[2021-05-16 00:27:12] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 186/187 places, 171/172 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-003B-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s86 1), p1:(EQ s185 1), p2:(EQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4785 reset in 128 ms.
Product exploration explored 100000 steps with 4690 reset in 142 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4793 reset in 126 ms.
Product exploration explored 100000 steps with 4758 reset in 142 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 186/186 places, 171/171 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 186 transition count 171
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 186 transition count 173
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 186 transition count 173
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 88 place count 186 transition count 173
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 108 place count 166 transition count 153
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 128 place count 166 transition count 153
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 128 rules in 15 ms. Remains 166 /186 variables (removed 20) and now considering 153/171 (removed 18) transitions.
[2021-05-16 00:27:13] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 153 rows 166 cols
[2021-05-16 00:27:13] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:27:13] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 166/186 places, 153/171 transitions.
Product exploration explored 100000 steps with 16949 reset in 425 ms.
Product exploration explored 100000 steps with 16980 reset in 335 ms.
[2021-05-16 00:27:14] [INFO ] Flatten gal took : 6 ms
[2021-05-16 00:27:14] [INFO ] Flatten gal took : 6 ms
[2021-05-16 00:27:14] [INFO ] Time to serialize gal into /tmp/LTL5970705784910066058.gal : 1 ms
[2021-05-16 00:27:14] [INFO ] Time to serialize properties into /tmp/LTL5128629620999230082.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5970705784910066058.gal, -t, CGAL, -LTL, /tmp/LTL5128629620999230082.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5970705784910066058.gal -t CGAL -LTL /tmp/LTL5128629620999230082.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((F("(p93==1)"))||(X(F("(p205==1)"))))||(G("(p120==1)"))))
Formula 0 simplified : !(F"(p93==1)" | XF"(p205==1)" | G"(p120==1)")
Detected timeout of ITS tools.
[2021-05-16 00:27:29] [INFO ] Flatten gal took : 14 ms
[2021-05-16 00:27:29] [INFO ] Applying decomposition
[2021-05-16 00:27:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12990641385723515588.txt, -o, /tmp/graph12990641385723515588.bin, -w, /tmp/graph12990641385723515588.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12990641385723515588.bin, -l, -1, -v, -w, /tmp/graph12990641385723515588.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:27:29] [INFO ] Decomposing Gal with order
[2021-05-16 00:27:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:27:29] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-16 00:27:29] [INFO ] Flatten gal took : 12 ms
[2021-05-16 00:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 00:27:29] [INFO ] Time to serialize gal into /tmp/LTL17534201683441222400.gal : 3 ms
[2021-05-16 00:27:29] [INFO ] Time to serialize properties into /tmp/LTL17681596782096282466.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17534201683441222400.gal, -t, CGAL, -LTL, /tmp/LTL17681596782096282466.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17534201683441222400.gal -t CGAL -LTL /tmp/LTL17681596782096282466.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((F("(i6.i0.u34.p93==1)"))||(X(F("(i12.i1.u71.p205==1)"))))||(G("(i7.i1.u45.p120==1)"))))
Formula 0 simplified : !(F"(i6.i0.u34.p93==1)" | XF"(i12.i1.u71.p205==1)" | G"(i7.i1.u45.p120==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin592583387643296114
[2021-05-16 00:27:44] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin592583387643296114
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin592583387643296114]
Compilation finished in 667 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin592583387643296114]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))||[]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin592583387643296114]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-04 finished in 47208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(X(!p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 171
Applied a total of 2 rules in 3 ms. Remains 186 /187 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:27:59] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:27:59] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:27:59] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-16 00:28:00] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:28:00] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:00] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 186/187 places, 171/172 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : ShieldPPPs-PT-003B-05 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s134 1), p1:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-05 finished in 415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((F(p1)&&X(X(F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 171
Applied a total of 2 rules in 3 ms. Remains 186 /187 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:28:00] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:00] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:28:00] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:00] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 186 cols
[2021-05-16 00:28:00] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:00] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 186/187 places, 171/172 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-003B-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s10 1), p1:(EQ s43 1), p2:(NEQ s15 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 662 steps with 1 reset in 3 ms.
FORMULA ShieldPPPs-PT-003B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-06 finished in 405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 146 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 145 transition count 130
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 96 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 16 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:28:00] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:00] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:28:00] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:00] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2021-05-16 00:28:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:28:00] [INFO ] Computed 34 place invariants in 3 ms
[2021-05-16 00:28:00] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-07 automaton TGBA [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:(EQ s86 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 202 steps with 1 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-07 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:00] [INFO ] Computed 34 place invariants in 3 ms
[2021-05-16 00:28:01] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:01] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:01] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-003B-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (NEQ s87 1) (NEQ s104 1)), p0:(EQ s173 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 199 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-08 finished in 376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 186 transition count 150
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 165 transition count 150
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 165 transition count 134
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 149 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 147 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 147 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 78 place count 147 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 176 place count 98 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 97 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 96 transition count 81
Applied a total of 178 rules in 16 ms. Remains 96 /187 variables (removed 91) and now considering 81/172 (removed 91) transitions.
// Phase 1: matrix 81 rows 96 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:01] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:01] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2021-05-16 00:28:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:01] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 96/187 places, 81/172 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s35 1) (EQ s5 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 190 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-09 finished in 218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 146 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 145 transition count 130
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 96 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 15 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:01] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:01] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2021-05-16 00:28:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:01] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 253 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-10 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((G(p1)||p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:01] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:01] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:02] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(NEQ s62 1), p0:(OR (EQ s62 0) (EQ s114 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Product exploration explored 100000 steps with 25000 reset in 171 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 144 ms.
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 185/185 places, 170/170 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 185 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 22 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 91 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 114 place count 162 transition count 148
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 137 place count 162 transition count 148
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 137 rules in 11 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2021-05-16 00:28:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 148 rows 162 cols
[2021-05-16 00:28:03] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:03] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/185 places, 148/170 transitions.
Product exploration explored 100000 steps with 25000 reset in 374 ms.
Product exploration explored 100000 steps with 25000 reset in 380 ms.
[2021-05-16 00:28:03] [INFO ] Flatten gal took : 6 ms
[2021-05-16 00:28:03] [INFO ] Flatten gal took : 5 ms
[2021-05-16 00:28:03] [INFO ] Time to serialize gal into /tmp/LTL12155311807867036747.gal : 1 ms
[2021-05-16 00:28:03] [INFO ] Time to serialize properties into /tmp/LTL5579623076372618592.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12155311807867036747.gal, -t, CGAL, -LTL, /tmp/LTL5579623076372618592.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12155311807867036747.gal -t CGAL -LTL /tmp/LTL5579623076372618592.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("((p67==0)||(p125==0))")||(G("(p67!=1)"))))))))
Formula 0 simplified : !XXXF("((p67==0)||(p125==0))" | G"(p67!=1)")
Detected timeout of ITS tools.
[2021-05-16 00:28:18] [INFO ] Flatten gal took : 6 ms
[2021-05-16 00:28:18] [INFO ] Applying decomposition
[2021-05-16 00:28:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8760727301551389517.txt, -o, /tmp/graph8760727301551389517.bin, -w, /tmp/graph8760727301551389517.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8760727301551389517.bin, -l, -1, -v, -w, /tmp/graph8760727301551389517.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:28:19] [INFO ] Decomposing Gal with order
[2021-05-16 00:28:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:28:19] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-16 00:28:19] [INFO ] Flatten gal took : 11 ms
[2021-05-16 00:28:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 00:28:19] [INFO ] Time to serialize gal into /tmp/LTL7192913631663896390.gal : 2 ms
[2021-05-16 00:28:19] [INFO ] Time to serialize properties into /tmp/LTL11900140032543878535.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7192913631663896390.gal, -t, CGAL, -LTL, /tmp/LTL11900140032543878535.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7192913631663896390.gal -t CGAL -LTL /tmp/LTL11900140032543878535.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("((i3.i1.u23.p67==0)||(i5.i1.u44.p125==0))")||(G("(i3.i1.u23.p67!=1)"))))))))
Formula 0 simplified : !XXXF("((i3.i1.u23.p67==0)||(i5.i1.u44.p125==0))" | G"(i3.i1.u23.p67!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5821152054073540622
[2021-05-16 00:28:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5821152054073540622
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5821152054073540622]
Compilation finished in 661 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5821152054073540622]
Link finished in 32 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>(([]((LTLAPp1==true))||(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5821152054073540622]
LTSmin run took 191 ms.
FORMULA ShieldPPPs-PT-003B-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-12 finished in 33146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 146 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 145 transition count 130
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 176 place count 98 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 97 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 96 transition count 81
Applied a total of 178 rules in 14 ms. Remains 96 /187 variables (removed 91) and now considering 81/172 (removed 91) transitions.
// Phase 1: matrix 81 rows 96 cols
[2021-05-16 00:28:34] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:35] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2021-05-16 00:28:35] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:35] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2021-05-16 00:28:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2021-05-16 00:28:35] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-16 00:28:35] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 96/187 places, 81/172 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 431 reset in 206 ms.
Stack based approach found an accepted trace after 21755 steps with 93 reset with depth 230 and stack size 230 in 50 ms.
FORMULA ShieldPPPs-PT-003B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-14 finished in 461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G((p0 U p1)))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:35] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:35] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:35] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:35] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 185 cols
[2021-05-16 00:28:35] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-16 00:28:35] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-003B-15 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s122 1), p1:(OR (EQ s1 1) (AND (EQ s142 1) (EQ s174 1))), p0:(AND (EQ s95 1) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-15 finished in 426 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11574837200761274980
[2021-05-16 00:28:35] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2021-05-16 00:28:35] [INFO ] Applying decomposition
[2021-05-16 00:28:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 00:28:35] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2021-05-16 00:28:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 00:28:35] [INFO ] Flatten gal took : 6 ms
[2021-05-16 00:28:35] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2021-05-16 00:28:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 00:28:35] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11574837200761274980
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11574837200761274980]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15290289918272694737.txt, -o, /tmp/graph15290289918272694737.bin, -w, /tmp/graph15290289918272694737.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15290289918272694737.bin, -l, -1, -v, -w, /tmp/graph15290289918272694737.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 00:28:35] [INFO ] Decomposing Gal with order
[2021-05-16 00:28:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:28:35] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-16 00:28:35] [INFO ] Flatten gal took : 11 ms
[2021-05-16 00:28:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 00:28:35] [INFO ] Time to serialize gal into /tmp/LTLFireability9939907934712141570.gal : 2 ms
[2021-05-16 00:28:35] [INFO ] Time to serialize properties into /tmp/LTLFireability3353698449794962491.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability9939907934712141570.gal, -t, CGAL, -LTL, /tmp/LTLFireability3353698449794962491.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability9939907934712141570.gal -t CGAL -LTL /tmp/LTLFireability3353698449794962491.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G(("(i5.i1.u28.p80!=1)")||(F("(i3.i1.u24.p67!=1)"))))))
Formula 0 simplified : !FG("(i5.i1.u28.p80!=1)" | F"(i3.i1.u24.p67!=1)")
Compilation finished in 751 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11574837200761274980]
Link finished in 32 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp0==true)||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11574837200761274980]
Reverse transition relation is NOT exact ! Due to transitions t66, t69, t97, t100, t103, t128, t131, t134, i0.u1.t138, i1.i1.u6.t137, i2.i0.u7.t136, i2.i1.u20.t116, i2.i1.u21.t7, i2.i1.u21.t8, i2.i1.u21.t10, i3.i0.u13.t130, i3.i1.u23.t110, i3.i1.u24.t11, i3.i1.u24.t12, i3.i1.u24.t14, i4.i0.u10.t133, i4.i1.u16.t124, i4.i1.u17.t3, i4.i1.u17.t4, i4.i1.u17.t5, i4.i1.u17.t6, i5.i1.u29.t106, i6.i0.u30.t105, i6.i1.u39.t93, i6.i1.u40.t18, i6.i1.u40.t19, i6.i1.u40.t21, i7.i0.u33.t102, i7.i1.u46.t79, i7.i1.u47.t26, i7.i1.u47.t27, i7.i1.u47.t29, i8.i0.u36.t99, i8.i1.t86, i8.i1.u43.t88, i8.i1.u44.t22, i8.i1.u44.t23, i8.i1.u44.t25, i9.t72, i9.i1.u52.t75, i9.i2.u53.t74, i9.i2.u62.t33, i9.i2.u62.t34, i9.i2.u62.t36, i10.i0.u56.t71, i10.i1.u68.t48, i10.i1.u69.t41, i10.i1.u69.t42, i10.i1.u69.t44, i11.i0.u59.t68, i11.i1.u65.t54, i11.i1.u66.t37, i11.i1.u66.t38, i11.i1.u66.t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/113/59/172
Computing Next relation with stutter on 7758 deadlock states
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp0==true)||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11574837200761274980]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp2==true))||X(<>((LTLAPp3==true)))||[]((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11574837200761274980]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp2==true))||X(<>((LTLAPp3==true)))||[]((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11574837200761274980]
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp0==true)||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11574837200761274980]
Detected timeout of ITS tools.
[2021-05-16 00:49:53] [INFO ] Applying decomposition
[2021-05-16 00:49:53] [INFO ] Flatten gal took : 7 ms
[2021-05-16 00:49:53] [INFO ] Decomposing Gal with order
[2021-05-16 00:49:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 00:49:53] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-16 00:49:53] [INFO ] Flatten gal took : 35 ms
[2021-05-16 00:49:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2021-05-16 00:49:53] [INFO ] Time to serialize gal into /tmp/LTLFireability16012849504947262912.gal : 2 ms
[2021-05-16 00:49:53] [INFO ] Time to serialize properties into /tmp/LTLFireability14982561777617509967.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16012849504947262912.gal, -t, CGAL, -LTL, /tmp/LTLFireability14982561777617509967.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16012849504947262912.gal -t CGAL -LTL /tmp/LTLFireability14982561777617509967.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G(("(i0.i1.i0.i0.i0.i0.i0.i0.u67.p80!=1)")||(F("(i0.i0.i1.u24.p67!=1)"))))))
Formula 0 simplified : !FG("(i0.i1.i0.i0.i0.i0.i0.i0.u67.p80!=1)" | F"(i0.i0.i1.u24.p67!=1)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.156: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.177: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.179: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.178: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.178: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.209: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.211: Initializing POR dependencies: labels 177, guards 172
pins2lts-mc-linux64( 6/ 8), 0.231: LTL layer: formula: <>([](((LTLAPp0==true)||<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 6/ 8), 0.231: "<>([](((LTLAPp0==true)||<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.231: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.260: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.283: There are 178 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.283: State length is 188, there are 178 groups
pins2lts-mc-linux64( 0/ 8), 0.283: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.283: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.283: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.283: Visible groups: 5 / 178, labels: 2 / 178
pins2lts-mc-linux64( 0/ 8), 0.283: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.283: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.376: [Blue] ~120 levels ~960 states ~1408 transitions
pins2lts-mc-linux64( 5/ 8), 0.395: [Blue] ~240 levels ~1920 states ~3384 transitions
pins2lts-mc-linux64( 6/ 8), 0.404: [Blue] ~480 levels ~3840 states ~6576 transitions
pins2lts-mc-linux64( 2/ 8), 0.419: [Blue] ~448 levels ~7680 states ~12824 transitions
pins2lts-mc-linux64( 7/ 8), 0.451: [Blue] ~672 levels ~15360 states ~24640 transitions
pins2lts-mc-linux64( 1/ 8), 0.508: [Blue] ~777 levels ~30720 states ~50904 transitions
pins2lts-mc-linux64( 2/ 8), 0.615: [Blue] ~448 levels ~61440 states ~85632 transitions
pins2lts-mc-linux64( 2/ 8), 0.891: [Blue] ~468 levels ~122880 states ~171792 transitions
pins2lts-mc-linux64( 2/ 8), 1.369: [Blue] ~468 levels ~245760 states ~333368 transitions
pins2lts-mc-linux64( 2/ 8), 2.354: [Blue] ~468 levels ~491520 states ~675832 transitions
pins2lts-mc-linux64( 2/ 8), 4.678: [Blue] ~544 levels ~983040 states ~1356736 transitions
pins2lts-mc-linux64( 2/ 8), 9.550: [Blue] ~544 levels ~1966080 states ~2786496 transitions
pins2lts-mc-linux64( 3/ 8), 19.419: [Blue] ~574 levels ~3932160 states ~5512920 transitions
pins2lts-mc-linux64( 4/ 8), 39.640: [Blue] ~1383 levels ~7864320 states ~11785176 transitions
pins2lts-mc-linux64( 3/ 8), 78.974: [Blue] ~574 levels ~15728640 states ~22969152 transitions
pins2lts-mc-linux64( 3/ 8), 152.868: [Blue] ~579 levels ~31457280 states ~45283832 transitions
pins2lts-mc-linux64( 3/ 8), 315.496: [Blue] ~579 levels ~62914560 states ~90824864 transitions
pins2lts-mc-linux64( 3/ 8), 636.491: [Blue] ~593 levels ~125829120 states ~181819600 transitions
pins2lts-mc-linux64( 3/ 8), 1162.319: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1162.334:
pins2lts-mc-linux64( 0/ 8), 1162.334: Explored 138621633 states 156778138 transitions, fanout: 1.131
pins2lts-mc-linux64( 0/ 8), 1162.334: Total exploration time 1162.040 sec (1162.010 sec minimum, 1162.021 sec on average)
pins2lts-mc-linux64( 0/ 8), 1162.334: States per second: 119292, Transitions per second: 134916
pins2lts-mc-linux64( 0/ 8), 1162.334:
pins2lts-mc-linux64( 0/ 8), 1162.334: State space has 134212060 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1162.334: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1162.334: blue states: 138621633 (103.29%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1162.334: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1162.334: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1162.334:
pins2lts-mc-linux64( 0/ 8), 1162.334: Total memory used for local state coloring: 712.4MB
pins2lts-mc-linux64( 0/ 8), 1162.334:
pins2lts-mc-linux64( 0/ 8), 1162.334: Queue width: 8B, total height: 46686514, memory: 356.19MB
pins2lts-mc-linux64( 0/ 8), 1162.334: Tree memory: 1145.1MB, 8.9 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 1162.334: Tree fill ratio (roots/leafs): 99.0%/47.0%
pins2lts-mc-linux64( 0/ 8), 1162.334: Stored 172 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1162.334: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1162.334: Est. total memory use: 1501.3MB (~1380.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp0==true)||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11574837200761274980]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp0==true)||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11574837200761274980]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-16 01:11:11] [INFO ] Flatten gal took : 146 ms
[2021-05-16 01:11:12] [INFO ] Input system was already deterministic with 172 transitions.
[2021-05-16 01:11:12] [INFO ] Transformed 187 places.
[2021-05-16 01:11:12] [INFO ] Transformed 172 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 01:11:12] [INFO ] Time to serialize gal into /tmp/LTLFireability3718198911188203840.gal : 5 ms
[2021-05-16 01:11:12] [INFO ] Time to serialize properties into /tmp/LTLFireability11156352027962888689.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability3718198911188203840.gal, -t, CGAL, -LTL, /tmp/LTLFireability11156352027962888689.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability3718198911188203840.gal -t CGAL -LTL /tmp/LTLFireability11156352027962888689.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(p80!=1)")||(F("(p67!=1)"))))))
Formula 0 simplified : !FG("(p80!=1)" | F"(p67!=1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="ShieldPPPs-PT-003B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-003B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205300557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-003B.tgz
mv ShieldPPPs-PT-003B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;