About the Execution of 2023-gold for ShieldPPPs-PT-005B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.012 | 3600000.00 | 6602090.00 | 291427.80 | ?TTFFFFFFTTTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788900268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788900268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 86K May 18 16:43 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-005B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716966574255
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 07:09:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 07:09:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 07:09:36] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-29 07:09:36] [INFO ] Transformed 343 places.
[2024-05-29 07:09:36] [INFO ] Transformed 318 transitions.
[2024-05-29 07:09:36] [INFO ] Found NUPN structural information;
[2024-05-29 07:09:36] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldPPPs-PT-005B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 317 transition count 292
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 317 transition count 292
Applied a total of 52 rules in 51 ms. Remains 317 /343 variables (removed 26) and now considering 292/318 (removed 26) transitions.
// Phase 1: matrix 292 rows 317 cols
[2024-05-29 07:09:36] [INFO ] Computed 56 invariants in 23 ms
[2024-05-29 07:09:36] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-29 07:09:36] [INFO ] Invariant cache hit.
[2024-05-29 07:09:37] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-05-29 07:09:37] [INFO ] Invariant cache hit.
[2024-05-29 07:09:37] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/343 places, 292/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 826 ms. Remains : 317/343 places, 292/318 transitions.
Support contains 31 out of 317 places after structural reductions.
[2024-05-29 07:09:37] [INFO ] Flatten gal took : 45 ms
[2024-05-29 07:09:37] [INFO ] Flatten gal took : 20 ms
[2024-05-29 07:09:37] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 30 out of 317 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-29 07:09:38] [INFO ] Invariant cache hit.
[2024-05-29 07:09:38] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2024-05-29 07:09:38] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ShieldPPPs-PT-005B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 66 stabilizing places and 66 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 280 transition count 255
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 280 transition count 230
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 255 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 247 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 247 transition count 222
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 247 transition count 217
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 148 place count 242 transition count 217
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 314 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 316 place count 157 transition count 132
Applied a total of 316 rules in 55 ms. Remains 157 /317 variables (removed 160) and now considering 132/292 (removed 160) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-05-29 07:09:38] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 07:09:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 07:09:38] [INFO ] Invariant cache hit.
[2024-05-29 07:09:38] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-29 07:09:38] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 07:09:38] [INFO ] Invariant cache hit.
[2024-05-29 07:09:38] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/317 places, 132/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 157/317 places, 132/292 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 169 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s55 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]]
Product exploration explored 100000 steps with 22461 reset in 418 ms.
Product exploration explored 100000 steps with 22276 reset in 274 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/157 stabilizing places and 2/132 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-29 07:09:40] [INFO ] Invariant cache hit.
[2024-05-29 07:09:40] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2024-05-29 07:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 07:09:40] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-29 07:09:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:09:40] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2024-05-29 07:09:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 07:09:40] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-29 07:09:40] [INFO ] Computed and/alt/rep : 129/248/129 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 07:09:40] [INFO ] Added : 115 causal constraints over 23 iterations in 341 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 07:09:40] [INFO ] Invariant cache hit.
[2024-05-29 07:09:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 07:09:40] [INFO ] Invariant cache hit.
[2024-05-29 07:09:41] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-29 07:09:41] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 07:09:41] [INFO ] Invariant cache hit.
[2024-05-29 07:09:41] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 157/157 places, 132/132 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/157 stabilizing places and 2/132 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-29 07:09:41] [INFO ] Invariant cache hit.
[2024-05-29 07:09:41] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 07:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 07:09:41] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-29 07:09:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:09:41] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 07:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 07:09:41] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-29 07:09:42] [INFO ] Computed and/alt/rep : 129/248/129 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 07:09:42] [INFO ] Added : 115 causal constraints over 23 iterations in 349 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22325 reset in 215 ms.
Product exploration explored 100000 steps with 22233 reset in 200 ms.
Built C files in :
/tmp/ltsmin334279841640937657
[2024-05-29 07:09:42] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-05-29 07:09:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:09:42] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-05-29 07:09:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:09:42] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-05-29 07:09:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:09:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin334279841640937657
Running compilation step : cd /tmp/ltsmin334279841640937657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 479 ms.
Running link step : cd /tmp/ltsmin334279841640937657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin334279841640937657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5621773650793363315.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 07:09:57] [INFO ] Invariant cache hit.
[2024-05-29 07:09:58] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 07:09:58] [INFO ] Invariant cache hit.
[2024-05-29 07:09:58] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-29 07:09:58] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 07:09:58] [INFO ] Invariant cache hit.
[2024-05-29 07:09:58] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 157/157 places, 132/132 transitions.
Built C files in :
/tmp/ltsmin12315443865981777212
[2024-05-29 07:09:58] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-05-29 07:09:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:09:58] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-05-29 07:09:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:09:58] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-05-29 07:09:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:09:58] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12315443865981777212
Running compilation step : cd /tmp/ltsmin12315443865981777212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 255 ms.
Running link step : cd /tmp/ltsmin12315443865981777212;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12315443865981777212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16887728711914613815.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:10:13] [INFO ] Flatten gal took : 15 ms
[2024-05-29 07:10:13] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:10:13] [INFO ] Time to serialize gal into /tmp/LTL16137540655834493509.gal : 2 ms
[2024-05-29 07:10:13] [INFO ] Time to serialize properties into /tmp/LTL8821161567625560454.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16137540655834493509.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17820899236881277762.hoa' '-atoms' '/tmp/LTL8821161567625560454.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8821161567625560454.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17820899236881277762.hoa
Detected timeout of ITS tools.
[2024-05-29 07:10:28] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:10:28] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:10:28] [INFO ] Time to serialize gal into /tmp/LTL16750565723267399530.gal : 2 ms
[2024-05-29 07:10:28] [INFO ] Time to serialize properties into /tmp/LTL13653960332247487349.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16750565723267399530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13653960332247487349.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("(p116==1)")))
Formula 0 simplified : G!"(p116==1)"
Detected timeout of ITS tools.
[2024-05-29 07:10:43] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:10:43] [INFO ] Applying decomposition
[2024-05-29 07:10:43] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16024981994295088965.txt' '-o' '/tmp/graph16024981994295088965.bin' '-w' '/tmp/graph16024981994295088965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16024981994295088965.bin' '-l' '-1' '-v' '-w' '/tmp/graph16024981994295088965.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:10:43] [INFO ] Decomposing Gal with order
[2024-05-29 07:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:10:43] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-29 07:10:43] [INFO ] Flatten gal took : 42 ms
[2024-05-29 07:10:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 7 ms.
[2024-05-29 07:10:43] [INFO ] Time to serialize gal into /tmp/LTL5721622423132012269.gal : 4 ms
[2024-05-29 07:10:43] [INFO ] Time to serialize properties into /tmp/LTL10662029326284719470.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5721622423132012269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10662029326284719470.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("(i4.u19.p116==1)")))
Formula 0 simplified : G!"(i4.u19.p116==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14207403020178704650
[2024-05-29 07:10:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14207403020178704650
Running compilation step : cd /tmp/ltsmin14207403020178704650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin14207403020178704650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14207403020178704650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-00 finished in 95557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 13 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-05-29 07:11:14] [INFO ] Computed 56 invariants in 3 ms
[2024-05-29 07:11:14] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-29 07:11:14] [INFO ] Invariant cache hit.
[2024-05-29 07:11:14] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-29 07:11:14] [INFO ] Invariant cache hit.
[2024-05-29 07:11:14] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s254 0), p1:(OR (EQ s284 1) (AND (EQ s203 1) (EQ s205 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/307 stabilizing places and 59/282 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005B-LTLFireability-01 finished in 1128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 280 transition count 255
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 280 transition count 230
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 255 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 247 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 247 transition count 222
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 247 transition count 217
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 148 place count 242 transition count 217
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 310 place count 161 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 159 transition count 134
Applied a total of 312 rules in 37 ms. Remains 159 /317 variables (removed 158) and now considering 134/292 (removed 158) transitions.
// Phase 1: matrix 134 rows 159 cols
[2024-05-29 07:11:15] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 07:11:15] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-29 07:11:15] [INFO ] Invariant cache hit.
[2024-05-29 07:11:15] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-29 07:11:15] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 07:11:15] [INFO ] Invariant cache hit.
[2024-05-29 07:11:15] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/317 places, 134/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 159/317 places, 134/292 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s20 1), p1:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 396 steps with 3 reset in 3 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-03 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1&&F(G(p1))))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 285
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 284
Applied a total of 16 rules in 17 ms. Remains 309 /317 variables (removed 8) and now considering 284/292 (removed 8) transitions.
// Phase 1: matrix 284 rows 309 cols
[2024-05-29 07:11:15] [INFO ] Computed 56 invariants in 6 ms
[2024-05-29 07:11:15] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-29 07:11:15] [INFO ] Invariant cache hit.
[2024-05-29 07:11:15] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-29 07:11:15] [INFO ] Invariant cache hit.
[2024-05-29 07:11:16] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 284/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 309/317 places, 284/292 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s188 0), p0:(EQ s294 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 48575 steps with 55 reset in 146 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-04 finished in 838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 316 transition count 254
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 279 transition count 254
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 279 transition count 229
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 254 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 246 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 246 transition count 221
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 140 place count 246 transition count 215
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 152 place count 240 transition count 215
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 316 place count 158 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 156 transition count 131
Applied a total of 318 rules in 33 ms. Remains 156 /317 variables (removed 161) and now considering 131/292 (removed 161) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-05-29 07:11:16] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 07:11:16] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 07:11:16] [INFO ] Invariant cache hit.
[2024-05-29 07:11:16] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-29 07:11:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 07:11:16] [INFO ] Invariant cache hit.
[2024-05-29 07:11:16] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/317 places, 131/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 349 ms. Remains : 156/317 places, 131/292 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s62 0)], 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 270 reset in 299 ms.
Product exploration explored 100000 steps with 275 reset in 307 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 179 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 07:11:17] [INFO ] Invariant cache hit.
[2024-05-29 07:11:17] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 07:11:17] [INFO ] Invariant cache hit.
[2024-05-29 07:11:18] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-29 07:11:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 07:11:18] [INFO ] Invariant cache hit.
[2024-05-29 07:11:18] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 257 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 268 reset in 262 ms.
Product exploration explored 100000 steps with 274 reset in 291 ms.
Built C files in :
/tmp/ltsmin4264111790888013711
[2024-05-29 07:11:19] [INFO ] Computing symmetric may disable matrix : 131 transitions.
[2024-05-29 07:11:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:19] [INFO ] Computing symmetric may enable matrix : 131 transitions.
[2024-05-29 07:11:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:19] [INFO ] Computing Do-Not-Accords matrix : 131 transitions.
[2024-05-29 07:11:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:19] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4264111790888013711
Running compilation step : cd /tmp/ltsmin4264111790888013711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 262 ms.
Running link step : cd /tmp/ltsmin4264111790888013711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4264111790888013711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15762488378727351212.hoa' '--buchi-type=spotba'
LTSmin run took 322 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005B-LTLFireability-06 finished in 3263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||G(F(p1)))) U X(G(p2)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 23 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-05-29 07:11:19] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 07:11:19] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-29 07:11:19] [INFO ] Invariant cache hit.
[2024-05-29 07:11:20] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-29 07:11:20] [INFO ] Invariant cache hit.
[2024-05-29 07:11:20] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s187 1), p0:(NEQ s200 1), p1:(AND (EQ s78 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14176 steps with 55 reset in 37 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-08 finished in 782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 15 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-05-29 07:11:20] [INFO ] Computed 56 invariants in 3 ms
[2024-05-29 07:11:20] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-29 07:11:20] [INFO ] Invariant cache hit.
[2024-05-29 07:11:20] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-29 07:11:20] [INFO ] Invariant cache hit.
[2024-05-29 07:11:21] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s96 1) (EQ s125 1) (EQ s119 1)) (EQ s59 1)), p0:(AND (EQ s138 0) (EQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9226 steps with 135 reset in 28 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-12 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!((X(p0) U p1) U p2))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 10 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-05-29 07:11:21] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 07:11:21] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 07:11:21] [INFO ] Invariant cache hit.
[2024-05-29 07:11:21] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-29 07:11:21] [INFO ] Invariant cache hit.
[2024-05-29 07:11:21] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, p2, (AND p2 p1 p0), (AND p1 p0), p2, p2]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p2:(OR (AND (EQ s269 1) (EQ s283 1)) (EQ s62 1)), p1:(AND (EQ s195 1) (EQ s62 1)), p0:(EQ s307 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/308 stabilizing places and 60/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, p2, (AND p2 p1 p0), (AND p1 p0), p2, p2]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 07:11:23] [INFO ] Invariant cache hit.
[2024-05-29 07:11:23] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p1 p2 p0)), (F (AND (NOT p1) p2 p0)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 462 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 308 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Applied a total of 0 rules in 6 ms. Remains 308 /308 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2024-05-29 07:11:23] [INFO ] Invariant cache hit.
[2024-05-29 07:11:24] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 07:11:24] [INFO ] Invariant cache hit.
[2024-05-29 07:11:24] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-29 07:11:24] [INFO ] Invariant cache hit.
[2024-05-29 07:11:24] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 308/308 places, 283/283 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/308 stabilizing places and 60/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
Finished Best-First random walk after 1391 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=695 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 159 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 157 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 25000 reset in 167 ms.
Product exploration explored 100000 steps with 25000 reset in 170 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 158 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 308 transition count 283
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 35 place count 308 transition count 285
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 46 place count 308 transition count 285
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 146 place count 308 transition count 285
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 181 place count 273 transition count 250
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 216 place count 273 transition count 250
Deduced a syphon composed of 111 places in 0 ms
Applied a total of 216 rules in 47 ms. Remains 273 /308 variables (removed 35) and now considering 250/283 (removed 33) transitions.
[2024-05-29 07:11:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 273 cols
[2024-05-29 07:11:26] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 07:11:26] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/308 places, 250/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 273/308 places, 250/283 transitions.
Built C files in :
/tmp/ltsmin6016498297930909352
[2024-05-29 07:11:26] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6016498297930909352
Running compilation step : cd /tmp/ltsmin6016498297930909352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 407 ms.
Running link step : cd /tmp/ltsmin6016498297930909352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6016498297930909352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1646148627336911741.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005B-LTLFireability-13 finished in 5777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 24 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-05-29 07:11:27] [INFO ] Computed 56 invariants in 5 ms
[2024-05-29 07:11:27] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 07:11:27] [INFO ] Invariant cache hit.
[2024-05-29 07:11:27] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-29 07:11:27] [INFO ] Invariant cache hit.
[2024-05-29 07:11:27] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s160 1) (AND (EQ s37 1) (EQ s39 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1818 reset in 177 ms.
Product exploration explored 100000 steps with 1781 reset in 181 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 92 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2024-05-29 07:11:28] [INFO ] Invariant cache hit.
[2024-05-29 07:11:28] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 07:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 07:11:28] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2024-05-29 07:11:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:11:28] [INFO ] [Nat]Absence check using 56 positive place invariants in 16 ms returned sat
[2024-05-29 07:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 07:11:29] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-29 07:11:29] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
[2024-05-29 07:11:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 07:11:29] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 2 ms to minimize.
[2024-05-29 07:11:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2024-05-29 07:11:29] [INFO ] Computed and/alt/rep : 281/497/281 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-29 07:11:31] [INFO ] Added : 273 causal constraints over 58 iterations in 2433 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 307/307 places, 282/282 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 306 transition count 245
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 270 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 269 transition count 244
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 269 transition count 219
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 244 transition count 219
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 294 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 296 place count 157 transition count 132
Applied a total of 296 rules in 30 ms. Remains 157 /307 variables (removed 150) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-05-29 07:11:31] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 07:11:31] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 07:11:31] [INFO ] Invariant cache hit.
[2024-05-29 07:11:32] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-29 07:11:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 07:11:32] [INFO ] Invariant cache hit.
[2024-05-29 07:11:32] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/307 places, 132/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 157/307 places, 132/282 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-29 07:11:32] [INFO ] Invariant cache hit.
[2024-05-29 07:11:32] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 07:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 07:11:32] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-29 07:11:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:11:32] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2024-05-29 07:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 07:11:32] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-29 07:11:32] [INFO ] Computed and/alt/rep : 129/256/129 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:11:33] [INFO ] Added : 113 causal constraints over 23 iterations in 496 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22603 reset in 193 ms.
Product exploration explored 100000 steps with 22603 reset in 206 ms.
Built C files in :
/tmp/ltsmin8633323988870407419
[2024-05-29 07:11:33] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-05-29 07:11:33] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:33] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-05-29 07:11:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:33] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-05-29 07:11:33] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8633323988870407419
Running compilation step : cd /tmp/ltsmin8633323988870407419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin8633323988870407419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8633323988870407419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2421255809970222227.hoa' '--buchi-type=spotba'
LTSmin run took 3432 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005B-LTLFireability-15 finished in 10599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-29 07:11:37] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7411481244681955954
[2024-05-29 07:11:37] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-29 07:11:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:37] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-29 07:11:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:37] [INFO ] Applying decomposition
[2024-05-29 07:11:37] [INFO ] Flatten gal took : 11 ms
[2024-05-29 07:11:37] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-29 07:11:37] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:11:37] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7411481244681955954
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6938800783322564433.txt' '-o' '/tmp/graph6938800783322564433.bin' '-w' '/tmp/graph6938800783322564433.weights'
Running compilation step : cd /tmp/ltsmin7411481244681955954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6938800783322564433.bin' '-l' '-1' '-v' '-w' '/tmp/graph6938800783322564433.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:11:37] [INFO ] Decomposing Gal with order
[2024-05-29 07:11:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:11:37] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-29 07:11:37] [INFO ] Flatten gal took : 23 ms
[2024-05-29 07:11:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 07:11:37] [INFO ] Time to serialize gal into /tmp/LTLFireability1506128640960360689.gal : 5 ms
[2024-05-29 07:11:37] [INFO ] Time to serialize properties into /tmp/LTLFireability4908733843490305115.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1506128640960360689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4908733843490305115.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(i3.u41.p116==1)")))
Formula 0 simplified : G!"(i3.u41.p116==1)"
Compilation finished in 557 ms.
Running link step : cd /tmp/ltsmin7411481244681955954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7411481244681955954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: Initializing POR dependencies: labels 293, guards 292
pins2lts-mc-linux64( 6/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.788: LTL layer: formula: <>((LTLAPp0==true))
pins2lts-mc-linux64( 3/ 8), 0.788: "<>((LTLAPp0==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.789: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.940: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.948: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.980: There are 295 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.980: State length is 318, there are 293 groups
pins2lts-mc-linux64( 0/ 8), 0.980: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.980: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.980: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.980: Visible groups: 0 / 293, labels: 1 / 295
pins2lts-mc-linux64( 0/ 8), 0.980: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.980: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.998: [Blue] ~120 levels ~960 states ~1184 transitions
pins2lts-mc-linux64( 0/ 8), 1.035: [Blue] ~228 levels ~1920 states ~3464 transitions
pins2lts-mc-linux64( 5/ 8), 1.101: [Blue] ~479 levels ~3840 states ~8760 transitions
pins2lts-mc-linux64( 0/ 8), 1.191: [Blue] ~709 levels ~7680 states ~14440 transitions
pins2lts-mc-linux64( 4/ 8), 1.339: [Blue] ~669 levels ~15360 states ~21528 transitions
pins2lts-mc-linux64( 0/ 8), 1.574: [Blue] ~709 levels ~30720 states ~42656 transitions
pins2lts-mc-linux64( 0/ 8), 2.005: [Blue] ~709 levels ~61440 states ~82192 transitions
pins2lts-mc-linux64( 0/ 8), 2.806: [Blue] ~709 levels ~122880 states ~164256 transitions
pins2lts-mc-linux64( 0/ 8), 4.305: [Blue] ~709 levels ~245760 states ~318976 transitions
pins2lts-mc-linux64( 0/ 8), 7.024: [Blue] ~709 levels ~491520 states ~652048 transitions
pins2lts-mc-linux64( 0/ 8), 11.629: [Blue] ~741 levels ~983040 states ~1315576 transitions
pins2lts-mc-linux64( 3/ 8), 20.561: [Blue] ~704 levels ~1966080 states ~2754896 transitions
pins2lts-mc-linux64( 0/ 8), 37.626: [Blue] ~741 levels ~3932160 states ~5347496 transitions
pins2lts-mc-linux64( 0/ 8), 73.489: [Blue] ~741 levels ~7864320 states ~10882840 transitions
pins2lts-mc-linux64( 3/ 8), 143.265: [Blue] ~748 levels ~15728640 states ~22837024 transitions
pins2lts-mc-linux64( 3/ 8), 282.115: [Blue] ~748 levels ~31457280 states ~45175056 transitions
pins2lts-mc-linux64( 3/ 8), 561.098: [Blue] ~748 levels ~62914560 states ~90149120 transitions
pins2lts-mc-linux64( 3/ 8), 1132.632: [Blue] ~748 levels ~125829120 states ~182861496 transitions
pins2lts-mc-linux64( 6/ 8), 1175.859: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1175.936:
pins2lts-mc-linux64( 0/ 8), 1175.936: Explored 113520030 states 164887238 transitions, fanout: 1.452
pins2lts-mc-linux64( 0/ 8), 1175.936: Total exploration time 1174.930 sec (1174.860 sec minimum, 1174.883 sec on average)
pins2lts-mc-linux64( 0/ 8), 1175.936: States per second: 96619, Transitions per second: 140338
pins2lts-mc-linux64( 0/ 8), 1175.936:
pins2lts-mc-linux64( 0/ 8), 1175.936: State space has 113525762 states, 113514344 are accepting
pins2lts-mc-linux64( 0/ 8), 1175.936: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1175.936: blue states: 113520030 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1175.936: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1175.936: all-red states: 113514344 (99.99%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1175.936:
pins2lts-mc-linux64( 0/ 8), 1175.936: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 1175.936:
pins2lts-mc-linux64( 0/ 8), 1175.936: Queue width: 8B, total height: 6295, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 1175.936: Tree memory: 1122.1MB, 10.4 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1175.936: Tree fill ratio (roots/leafs): 84.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1175.936: Stored 297 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1175.936: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1175.936: Est. total memory use: 1122.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7411481244681955954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7411481244681955954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 07:32:18] [INFO ] Applying decomposition
[2024-05-29 07:32:18] [INFO ] Flatten gal took : 11 ms
[2024-05-29 07:32:18] [INFO ] Decomposing Gal with order
[2024-05-29 07:32:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:32:18] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-29 07:32:18] [INFO ] Flatten gal took : 20 ms
[2024-05-29 07:32:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 5 ms.
[2024-05-29 07:32:18] [INFO ] Time to serialize gal into /tmp/LTLFireability3136499597178275076.gal : 9 ms
[2024-05-29 07:32:18] [INFO ] Time to serialize properties into /tmp/LTLFireability7166194522060811533.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3136499597178275076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7166194522060811533.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(i0.i0.i0.i1.i0.i0.i0.u44.p116==1)")))
Formula 0 simplified : G!"(i0.i0.i0.i1.i0.i0.i0.u44.p116==1)"
Detected timeout of ITS tools.
[2024-05-29 07:53:07] [INFO ] Flatten gal took : 297 ms
[2024-05-29 07:53:08] [INFO ] Input system was already deterministic with 292 transitions.
[2024-05-29 07:53:08] [INFO ] Transformed 317 places.
[2024-05-29 07:53:08] [INFO ] Transformed 292 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 07:53:08] [INFO ] Time to serialize gal into /tmp/LTLFireability12525495687404856771.gal : 10 ms
[2024-05-29 07:53:08] [INFO ] Time to serialize properties into /tmp/LTLFireability4005831556293468323.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12525495687404856771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4005831556293468323.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(p116==1)")))
Formula 0 simplified : G!"(p116==1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 150776 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16060132 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPs-PT-005B, 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 r373-tall-171683788900268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-005B.tgz
mv ShieldPPPs-PT-005B 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 ;