Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838851100891.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is GPPP-PT-C1000N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838851100891
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679598495915

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000000100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 19:08:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 19:08:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 19:08:17] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-23 19:08:17] [INFO ] Transformed 33 places.
[2023-03-23 19:08:17] [INFO ] Transformed 22 transitions.
[2023-03-23 19:08:17] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 19:08:17] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-23 19:08:17] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 19:08:17] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-23 19:08:17] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 19:08:17] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:17] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 27 out of 32 places after structural reductions.
[2023-03-23 19:08:18] [INFO ] Flatten gal took : 16 ms
[2023-03-23 19:08:18] [INFO ] Flatten gal took : 5 ms
[2023-03-23 19:08:18] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10009 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 25) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:18] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-23 19:08:18] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 19:08:18] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2023-03-23 19:08:18] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-23 19:08:18] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1 U X(p2)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:19] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:19] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-23 19:08:19] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:19] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-23 19:08:19] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 110 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 549 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}], [{ cond=p0, acceptance={} source=7 dest: 0}, { cond=(NOT p0), acceptance={} source=7 dest: 3}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(GT 2 s14), p1:(LEQ 3 s10), p2:(LEQ s9 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 206 ms.
Product exploration explored 100000 steps with 33333 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p2)))))
Knowledge based reduction with 15 factoid took 288 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-02 finished in 1372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (!p0&&F(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:20] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:20] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:20] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:20] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:20] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 73 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s19 s1), p1:(LEQ 1 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-03 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 14
Applied a total of 17 rules in 15 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-23 19:08:20] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-23 19:08:20] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:20] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2023-03-23 19:08:20] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [0, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 66 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 14/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 17 transition count 13
Applied a total of 2 rules in 3 ms. Remains 17 /18 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 17 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 17/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s13) (GT s7 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-04 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 19 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 18 transition count 12
Applied a total of 23 rules in 8 ms. Remains 18 /32 variables (removed 14) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [0, 11]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 61 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-06 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-07 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:(OR (LEQ s28 s12) (AND (GT 1 s19) (GT 2 s2)))], 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 41 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-07 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 82 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GT s12 s4)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-08 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 19 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 18 transition count 12
Applied a total of 23 rules in 5 ms. Remains 18 /32 variables (removed 14) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:21] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [0, 11]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 66 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 12/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-09 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 s2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-09 finished in 142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-23 19:08:21] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s18), p0:(GT 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1519 reset in 148 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-10 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(X(p1))))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-23 19:08:22] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-23 19:08:22] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 87 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(GT 3 s14), p1:(GT 1 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 141 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-11 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 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 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 7 place count 28 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 25 transition count 17
Applied a total of 12 rules in 11 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-23 19:08:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 17 rows 25 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:22] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:22] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [0, 2, 3, 18]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 75 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 20 transition count 16
Applied a total of 2 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 20 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-23 19:08:22] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 16 rows 20 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-23 19:08:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/32 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 20/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s12), p0:(LEQ s11 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-12 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 21 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 20 transition count 13
Applied a total of 20 rules in 9 ms. Remains 20 /32 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:22] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 19:08:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:08:23] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [0, 13]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 79 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 13/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 18/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-13 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:(GT 2 s9), p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 110 reset in 120 ms.
Product exploration explored 100000 steps with 111 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 48 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5869 steps, including 2 resets, run visited all 2 properties in 4 ms. (steps per millisecond=1467 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 18 cols
[2023-03-23 19:08:23] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 13 rows 18 cols
[2023-03-23 19:08:23] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:24] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2023-03-23 19:08:24] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:08:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-23 19:08:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2023-03-23 19:08:24] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 18/18 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 48 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10293 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1143 ) properties (out of 2) seen :1
Finished Best-First random walk after 1356 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=452 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 108 reset in 89 ms.
Product exploration explored 100000 steps with 110 reset in 87 ms.
Built C files in :
/tmp/ltsmin7611652992042546406
[2023-03-23 19:08:25] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2023-03-23 19:08:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 19:08:25] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2023-03-23 19:08:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 19:08:25] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2023-03-23 19:08:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 19:08:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7611652992042546406
Running compilation step : cd /tmp/ltsmin7611652992042546406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin7611652992042546406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7611652992042546406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15770187042956796867.hoa' '--buchi-type=spotba'
LTSmin run took 224 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-13 finished in 2577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 21 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 20 transition count 13
Applied a total of 20 rules in 5 ms. Remains 20 /32 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 19:08:25] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 19:08:25] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 19:08:25] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2023-03-23 19:08:25] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 19:08:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:08:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [0, 2, 13]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 73 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/32 places, 13/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 17/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-14 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 s10 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64570 steps with 51 reset in 73 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-14 finished in 226 ms.
All properties solved by simple procedures.
Total runtime 8434 ms.

BK_STOP 1679598506579

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C1000N0000000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C1000N0000000100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838851100891"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;