About the Execution of ITS-Tools for PermAdmissibility-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 537.212 | 36055.00 | 65081.00 | 468.70 | TTFTTFTTTFTTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998800395.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PermAdmissibility-PT-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998800395
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.4K Apr 29 12:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 12:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 29 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 291K Apr 29 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 484K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653087647753
Running Version 202205111006
[2022-05-20 23:00:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 23:00:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:00:50] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2022-05-20 23:00:50] [INFO ] Transformed 168 places.
[2022-05-20 23:00:50] [INFO ] Transformed 592 transitions.
[2022-05-20 23:00:50] [INFO ] Parsed PT model containing 168 places and 592 transitions in 575 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-PT-01-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 89 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 137 transition count 592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 132 transition count 512
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 132 transition count 512
Applied a total of 41 rules in 63 ms. Remains 132 /168 variables (removed 36) and now considering 512/592 (removed 80) transitions.
// Phase 1: matrix 512 rows 132 cols
[2022-05-20 23:00:50] [INFO ] Computed 20 place invariants in 30 ms
[2022-05-20 23:00:51] [INFO ] Implicit Places using invariants in 452 ms returned []
// Phase 1: matrix 512 rows 132 cols
[2022-05-20 23:00:51] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-20 23:00:52] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 132 cols
[2022-05-20 23:00:52] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-20 23:00:52] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/168 places, 512/592 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/168 places, 512/592 transitions.
Support contains 89 out of 132 places after structural reductions.
[2022-05-20 23:00:52] [INFO ] Flatten gal took : 143 ms
[2022-05-20 23:00:53] [INFO ] Flatten gal took : 83 ms
[2022-05-20 23:00:53] [INFO ] Input system was already deterministic with 512 transitions.
Support contains 86 out of 132 places (down from 89) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 867 ms. (steps per millisecond=11 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10000 steps, including 208 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 208 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 208 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 208 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 208 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 512 rows 132 cols
[2022-05-20 23:00:55] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-20 23:00:55] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 23:00:55] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 15 ms returned sat
[2022-05-20 23:00:55] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
Computed a total of 132 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 132 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Graph (complete) has 1130 edges and 132 vertex of which 107 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.12 ms
Discarding 25 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 98 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 33 place count 84 transition count 242
Iterating global reduction 0 with 14 rules applied. Total rules applied 47 place count 84 transition count 242
Applied a total of 47 rules in 74 ms. Remains 84 /132 variables (removed 48) and now considering 242/512 (removed 270) transitions.
// Phase 1: matrix 242 rows 84 cols
[2022-05-20 23:00:55] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 23:00:56] [INFO ] Implicit Places using invariants in 194 ms returned [0, 19, 39, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 198 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/132 places, 242/512 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 80 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 79 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 79 transition count 240
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 78 transition count 240
Applied a total of 4 rules in 34 ms. Remains 78 /80 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 78 cols
[2022-05-20 23:00:56] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 23:00:56] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 240 rows 78 cols
[2022-05-20 23:00:56] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 23:00:56] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/132 places, 240/512 transitions.
Finished structural reductions, in 2 iterations. Remains : 78/132 places, 240/512 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s18 s19 s20 s21 s23 s24 s25 s26) (ADD s9 s10 s11 s12 s13 s14 s15 s16))], 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 6666 reset in 612 ms.
Product exploration explored 100000 steps with 6666 reset in 429 ms.
Computed a total of 78 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 240
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 16 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 240/240 transitions.
Applied a total of 0 rules in 26 ms. Remains 78 /78 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 78 cols
[2022-05-20 23:00:58] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 23:00:58] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 240 rows 78 cols
[2022-05-20 23:00:58] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-20 23:00:59] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2022-05-20 23:00:59] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 240 rows 78 cols
[2022-05-20 23:00:59] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 23:00:59] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 240/240 transitions.
Computed a total of 78 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 240
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6666 reset in 397 ms.
Product exploration explored 100000 steps with 6666 reset in 414 ms.
Built C files in :
/tmp/ltsmin4172388672045824637
[2022-05-20 23:01:00] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2022-05-20 23:01:00] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:00] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2022-05-20 23:01:00] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:00] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2022-05-20 23:01:01] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:01] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4172388672045824637
Running compilation step : cd /tmp/ltsmin4172388672045824637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1461 ms.
Running link step : cd /tmp/ltsmin4172388672045824637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin4172388672045824637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased732707093244746468.hoa' '--buchi-type=spotba'
LTSmin run took 345 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-01 finished in 7195 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((G(F(p0))||p1))))))'
Support contains 14 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Graph (complete) has 1130 edges and 132 vertex of which 81 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.5 ms
Discarding 51 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 69 transition count 242
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 69 transition count 242
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 65 transition count 226
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 65 transition count 226
Applied a total of 33 rules in 44 ms. Remains 65 /132 variables (removed 67) and now considering 226/512 (removed 286) transitions.
// Phase 1: matrix 226 rows 65 cols
[2022-05-20 23:01:02] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 23:01:03] [INFO ] Implicit Places using invariants in 128 ms returned [0, 20, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 129 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/132 places, 226/512 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 61 transition count 224
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 60 transition count 224
Applied a total of 4 rules in 23 ms. Remains 60 /62 variables (removed 2) and now considering 224/226 (removed 2) transitions.
// Phase 1: matrix 224 rows 60 cols
[2022-05-20 23:01:03] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 23:01:03] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 224 rows 60 cols
[2022-05-20 23:01:03] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 23:01:03] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/132 places, 224/512 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/132 places, 224/512 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s52 s53)), p0:(GT (ADD s26 s27 s35 s36) (ADD s0 s1 s2 s3 s5 s6 s7 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-02 finished in 889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 54 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 75 place count 78 transition count 344
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 92 place count 61 transition count 122
Iterating global reduction 1 with 17 rules applied. Total rules applied 109 place count 61 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 60 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 60 transition count 114
Applied a total of 111 rules in 14 ms. Remains 60 /132 variables (removed 72) and now considering 114/512 (removed 398) transitions.
// Phase 1: matrix 114 rows 60 cols
[2022-05-20 23:01:03] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:01:03] [INFO ] Implicit Places using invariants in 164 ms returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 167 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/132 places, 114/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/132 places, 114/512 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s49 s50) (ADD s22 s24 s25 s26 s27 s41 s42 s43))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-05 finished in 292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&((!p0 U false) U X(!X(X(!p0))))))'
Support contains 8 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 512
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 85 transition count 372
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 75 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 75 transition count 262
Applied a total of 81 rules in 14 ms. Remains 75 /132 variables (removed 57) and now considering 262/512 (removed 250) transitions.
// Phase 1: matrix 262 rows 75 cols
[2022-05-20 23:01:04] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-20 23:01:04] [INFO ] Implicit Places using invariants in 178 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 186 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/132 places, 262/512 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/132 places, 262/512 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 253 ms.
Product exploration explored 100000 steps with 25000 reset in 376 ms.
Computed a total of 74 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 8 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 262/262 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 74 cols
[2022-05-20 23:01:06] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-20 23:01:06] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 262 rows 74 cols
[2022-05-20 23:01:06] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-20 23:01:06] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 74 cols
[2022-05-20 23:01:06] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-20 23:01:07] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 262/262 transitions.
Computed a total of 74 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 302 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Product exploration explored 100000 steps with 25000 reset in 242 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 8 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2022-05-20 23:01:09] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 262 rows 74 cols
[2022-05-20 23:01:09] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-20 23:01:09] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 262/262 transitions.
Product exploration explored 100000 steps with 25000 reset in 763 ms.
Product exploration explored 100000 steps with 25000 reset in 509 ms.
Built C files in :
/tmp/ltsmin8379880747362037906
[2022-05-20 23:01:10] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8379880747362037906
Running compilation step : cd /tmp/ltsmin8379880747362037906;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 648 ms.
Running link step : cd /tmp/ltsmin8379880747362037906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8379880747362037906;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7077925741887684384.hoa' '--buchi-type=spotba'
LTSmin run took 142 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-07 finished in 7720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(p0)))))'
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 100 transition count 512
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 51 place count 81 transition count 348
Iterating global reduction 1 with 19 rules applied. Total rules applied 70 place count 81 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 92 place count 59 transition count 126
Iterating global reduction 1 with 22 rules applied. Total rules applied 114 place count 59 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 57 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 57 transition count 110
Applied a total of 118 rules in 8 ms. Remains 57 /132 variables (removed 75) and now considering 110/512 (removed 402) transitions.
// Phase 1: matrix 110 rows 57 cols
[2022-05-20 23:01:11] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:01:11] [INFO ] Implicit Places using invariants in 152 ms returned [0, 5, 22, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 154 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/132 places, 110/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 53/132 places, 110/512 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (GT s43 s10) (GT 1 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 263 ms.
Product exploration explored 100000 steps with 25000 reset in 280 ms.
Computed a total of 53 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 53 cols
[2022-05-20 23:01:13] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 23:01:13] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 110 rows 53 cols
[2022-05-20 23:01:13] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 23:01:14] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 53 cols
[2022-05-20 23:01:14] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 23:01:14] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 110/110 transitions.
Computed a total of 53 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 111 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 226 ms.
Product exploration explored 100000 steps with 25000 reset in 270 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 110/110 transitions.
Graph (complete) has 251 edges and 53 vertex of which 49 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 49 /53 variables (removed 4) and now considering 106/110 (removed 4) transitions.
[2022-05-20 23:01:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 106 rows 49 cols
[2022-05-20 23:01:16] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 23:01:16] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/53 places, 106/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/53 places, 106/110 transitions.
Product exploration explored 100000 steps with 25000 reset in 593 ms.
Product exploration explored 100000 steps with 25000 reset in 433 ms.
Built C files in :
/tmp/ltsmin15870027116186217606
[2022-05-20 23:01:17] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15870027116186217606
Running compilation step : cd /tmp/ltsmin15870027116186217606;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 314 ms.
Running link step : cd /tmp/ltsmin15870027116186217606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin15870027116186217606;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11240420321835107578.hoa' '--buchi-type=spotba'
LTSmin run took 397 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-08 finished in 6587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)||p0))))'
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 54 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 75 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 99 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 123 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 51 transition count 84
Applied a total of 129 rules in 12 ms. Remains 51 /132 variables (removed 81) and now considering 84/512 (removed 428) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-20 23:01:18] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:01:18] [INFO ] Implicit Places using invariants in 157 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 159 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/132 places, 84/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/132 places, 84/512 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s16)], 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 11111 reset in 270 ms.
Product exploration explored 100000 steps with 11111 reset in 298 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 84 rows 47 cols
[2022-05-20 23:01:19] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 23:01:20] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 10 ms returned sat
[2022-05-20 23:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:01:20] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 23:01:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:01:20] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 10 ms returned sat
[2022-05-20 23:01:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:01:20] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-20 23:01:20] [INFO ] Computed and/alt/rep : 19/94/19 causal constraints (skipped 61 transitions) in 13 ms.
[2022-05-20 23:01:20] [INFO ] Added : 3 causal constraints over 1 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 84/84 transitions.
Graph (complete) has 198 edges and 47 vertex of which 37 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 33 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 33 transition count 58
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 29 transition count 40
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 29 transition count 40
Applied a total of 17 rules in 7 ms. Remains 29 /47 variables (removed 18) and now considering 40/84 (removed 44) transitions.
// Phase 1: matrix 40 rows 29 cols
[2022-05-20 23:01:20] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 23:01:20] [INFO ] Implicit Places using invariants in 99 ms returned [8, 12, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/47 places, 40/84 transitions.
Graph (complete) has 77 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 25 cols
[2022-05-20 23:01:20] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 23:01:20] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 39 rows 25 cols
[2022-05-20 23:01:20] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 23:01:20] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/47 places, 39/84 transitions.
Finished structural reductions, in 2 iterations. Remains : 25/47 places, 39/84 transitions.
Computed a total of 25 stabilizing places and 39 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 39
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 39 rows 25 cols
[2022-05-20 23:01:21] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 23:01:21] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-20 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:01:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-20 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:01:21] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-20 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:01:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-20 23:01:21] [INFO ] Computed and/alt/rep : 26/145/26 causal constraints (skipped 9 transitions) in 8 ms.
[2022-05-20 23:01:21] [INFO ] Added : 10 causal constraints over 3 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 187 ms.
Product exploration explored 100000 steps with 11111 reset in 215 ms.
Built C files in :
/tmp/ltsmin18243150959751352399
[2022-05-20 23:01:21] [INFO ] Computing symmetric may disable matrix : 39 transitions.
[2022-05-20 23:01:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:21] [INFO ] Computing symmetric may enable matrix : 39 transitions.
[2022-05-20 23:01:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:21] [INFO ] Computing Do-Not-Accords matrix : 39 transitions.
[2022-05-20 23:01:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18243150959751352399
Running compilation step : cd /tmp/ltsmin18243150959751352399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 180 ms.
Running link step : cd /tmp/ltsmin18243150959751352399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin18243150959751352399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8169027222793631871.hoa' '--buchi-type=spotba'
LTSmin run took 58 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-10 finished in 3795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Graph (complete) has 1130 edges and 132 vertex of which 81 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.3 ms
Discarding 51 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 63 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 63 transition count 230
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 53 place count 47 transition count 94
Iterating global reduction 0 with 16 rules applied. Total rules applied 69 place count 47 transition count 94
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 72 place count 44 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 44 transition count 70
Applied a total of 75 rules in 19 ms. Remains 44 /132 variables (removed 88) and now considering 70/512 (removed 442) transitions.
// Phase 1: matrix 70 rows 44 cols
[2022-05-20 23:01:22] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 23:01:22] [INFO ] Implicit Places using invariants in 95 ms returned [0, 13, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/132 places, 70/512 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 41 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 69
Applied a total of 2 rules in 11 ms. Remains 40 /41 variables (removed 1) and now considering 69/70 (removed 1) transitions.
// Phase 1: matrix 69 rows 40 cols
[2022-05-20 23:01:22] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 23:01:22] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 69 rows 40 cols
[2022-05-20 23:01:22] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 23:01:22] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/132 places, 69/512 transitions.
Finished structural reductions, in 2 iterations. Remains : 40/132 places, 69/512 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-12 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !F(p1)))'
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Graph (complete) has 1130 edges and 132 vertex of which 100 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 80 transition count 348
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 63 place count 58 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 85 place count 58 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 88 place count 55 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 91 place count 55 transition count 94
Applied a total of 91 rules in 25 ms. Remains 55 /132 variables (removed 77) and now considering 94/512 (removed 418) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-20 23:01:22] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:01:22] [INFO ] Implicit Places using invariants in 120 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/132 places, 94/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/132 places, 94/512 transitions.
Stuttering acceptance computed with spot in 267 ms :[p1, true, p1]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s10), p0:(LEQ s1 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 66 steps with 3 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-13 finished in 443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&X(p1))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 512/512 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 54 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 75 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 99 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 123 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 51 transition count 84
Applied a total of 129 rules in 9 ms. Remains 51 /132 variables (removed 81) and now considering 84/512 (removed 428) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-20 23:01:23] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-20 23:01:23] [INFO ] Implicit Places using invariants in 103 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 105 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/132 places, 84/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/132 places, 84/512 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s1 s30), p1:(LEQ s40 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-15 finished in 231 ms.
All properties solved by simple procedures.
Total runtime 33394 ms.
BK_STOP 1653087683808
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-01, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998800395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-01.tgz
mv PermAdmissibility-PT-01 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;