Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r500-smll-171649588000363.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is IOTPpurchase-PT-C01M01P01D01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588000363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 63K May 18 16:42 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 IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717286722315

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C01M01P01D01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 00:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:05:24] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 00:05:24] [INFO ] Transformed 111 places.
[2024-06-02 00:05:24] [INFO ] Transformed 45 transitions.
[2024-06-02 00:05:24] [INFO ] Found NUPN structural information;
[2024-06-02 00:05:24] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 33 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 71 transition count 45
Applied a total of 40 rules in 38 ms. Remains 71 /111 variables (removed 40) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 71 cols
[2024-06-02 00:05:24] [INFO ] Computed 27 invariants in 16 ms
[2024-06-02 00:05:24] [INFO ] Implicit Places using invariants in 386 ms returned [12, 23, 36, 39, 41, 42, 44, 45, 47, 48]
[2024-06-02 00:05:24] [INFO ] Actually due to overlaps returned [12, 23, 36, 39, 41, 42, 45, 47, 48]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 435 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/111 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 506 ms. Remains : 62/111 places, 45/45 transitions.
Support contains 27 out of 62 places after structural reductions.
[2024-06-02 00:05:25] [INFO ] Flatten gal took : 30 ms
[2024-06-02 00:05:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 00:05:25] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40000 steps (8 resets) in 1510 ms. (26 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40000 steps (8 resets) in 609 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
// Phase 1: matrix 45 rows 62 cols
[2024-06-02 00:05:26] [INFO ] Computed 18 invariants in 4 ms
[2024-06-02 00:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 3 (OVERLAPS) 43/52 variables, 8/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 43/61 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/54 variables, 2/63 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 2/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 62/107 variables, and 72 constraints, problems are : Problem set: 3 solved, 0 unsolved in 116 ms.
Refiners :[Domain max(s): 54/62 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/62 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13 TRUE 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p1&&X(p1))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 59 transition count 45
Applied a total of 3 rules in 3 ms. Remains 59 /62 variables (removed 3) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 59 cols
[2024-06-02 00:05:26] [INFO ] Computed 15 invariants in 7 ms
[2024-06-02 00:05:26] [INFO ] Implicit Places using invariants in 110 ms returned [5, 13, 19, 32, 33, 34, 35, 36]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 123 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/62 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 51/62 places, 45/45 transitions.
Stuttering acceptance computed with spot in 362 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 176 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 p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 finished in 1141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 45
Applied a total of 4 rules in 3 ms. Remains 58 /62 variables (removed 4) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2024-06-02 00:05:27] [INFO ] Computed 14 invariants in 2 ms
[2024-06-02 00:05:27] [INFO ] Implicit Places using invariants in 110 ms returned [5, 12, 18, 25, 32, 33, 34, 35]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 113 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/62 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 50/62 places, 45/45 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04 finished in 263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 45
Applied a total of 4 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 45/45 (removed 0) transitions.
[2024-06-02 00:05:27] [INFO ] Invariant cache hit.
[2024-06-02 00:05:27] [INFO ] Implicit Places using invariants in 90 ms returned [5, 12, 18, 25, 31, 32, 33, 34, 35]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 92 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/62 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 49/62 places, 45/45 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 58 transition count 29
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 39 place count 40 transition count 25
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 44 place count 36 transition count 24
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 47 place count 34 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 48 place count 33 transition count 23
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 48 place count 33 transition count 15
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 67 place count 22 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 70 place count 20 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 70 place count 20 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 72 place count 19 transition count 13
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 13 rules applied. Total rules applied 85 place count 11 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 86 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 88 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 89 place count 9 transition count 6
Applied a total of 89 rules in 35 ms. Remains 9 /62 variables (removed 53) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-02 00:05:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 00:05:28] [INFO ] Implicit Places using invariants in 33 ms returned [3, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/62 places, 6/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 7 transition count 5
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 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 4 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-06-02 00:05:28] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 00:05:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 00:05:28] [INFO ] Invariant cache hit.
[2024-06-02 00:05:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/62 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 5/62 places, 4/45 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 166 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07 finished in 363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 45
Applied a total of 4 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2024-06-02 00:05:28] [INFO ] Computed 14 invariants in 11 ms
[2024-06-02 00:05:28] [INFO ] Implicit Places using invariants in 104 ms returned [5, 13, 18, 25, 31, 32, 33, 34, 35]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 107 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/62 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 49/62 places, 45/45 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08
Product exploration explored 100000 steps with 2504 reset in 196 ms.
Product exploration explored 100000 steps with 2503 reset in 169 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 154 steps (0 resets) in 4 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 49 cols
[2024-06-02 00:05:29] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 00:05:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 00:05:29] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 10 ms returned sat
[2024-06-02 00:05:29] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 00:05:29] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-02 00:05:29] [INFO ] Added : 37 causal constraints over 8 iterations in 123 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 49 transition count 14
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 17 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 64 place count 17 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 13 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 11 transition count 8
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 87 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 87 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 90 place count 2 transition count 2
Applied a total of 90 rules in 12 ms. Remains 2 /49 variables (removed 47) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-02 00:05:29] [INFO ] Computed 1 invariants in 0 ms
[2024-06-02 00:05:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-02 00:05:29] [INFO ] Invariant cache hit.
[2024-06-02 00:05:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-02 00:05:29] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-02 00:05:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/49 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 2/49 places, 2/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08 finished in 1567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 45
Applied a total of 4 rules in 3 ms. Remains 58 /62 variables (removed 4) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2024-06-02 00:05:30] [INFO ] Computed 14 invariants in 1 ms
[2024-06-02 00:05:30] [INFO ] Implicit Places using invariants in 84 ms returned [5, 12, 25, 31, 32, 33, 34, 35]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 85 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/62 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 50/62 places, 45/45 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 45
Applied a total of 4 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 45/45 (removed 0) transitions.
[2024-06-02 00:05:30] [INFO ] Invariant cache hit.
[2024-06-02 00:05:30] [INFO ] Implicit Places using invariants in 74 ms returned [5, 12, 18, 25, 31, 32, 33, 34, 35]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 75 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/62 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 49/62 places, 45/45 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11
Product exploration explored 100000 steps with 4000 reset in 82 ms.
Product exploration explored 100000 steps with 4000 reset in 127 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 96 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 49 cols
[2024-06-02 00:05:31] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 00:05:31] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 00:05:31] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 00:05:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 00:05:31] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-02 00:05:31] [INFO ] Added : 22 causal constraints over 5 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 00:05:31] [INFO ] Invariant cache hit.
[2024-06-02 00:05:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 00:05:31] [INFO ] Invariant cache hit.
[2024-06-02 00:05:31] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:05:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 45/94 variables, 49/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 103 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1046 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 45/94 variables, 49/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/94 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 147 constraints, problems are : Problem set: 0 solved, 44 unsolved in 858 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1921ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1923ms
Finished structural reductions in LTL mode , in 1 iterations and 2045 ms. Remains : 49/49 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 96 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-02 00:05:34] [INFO ] Invariant cache hit.
[2024-06-02 00:05:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 00:05:34] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 00:05:34] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-02 00:05:34] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-02 00:05:34] [INFO ] Added : 22 causal constraints over 5 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4000 reset in 214 ms.
Product exploration explored 100000 steps with 4000 reset in 175 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 49 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 22 place count 49 transition count 45
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 33 place count 49 transition count 45
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 57 place count 25 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 81 place count 25 transition count 21
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 25 transition count 21
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 23 transition count 19
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 23 transition count 19
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 91 rules in 11 ms. Remains 23 /49 variables (removed 26) and now considering 19/45 (removed 26) transitions.
[2024-06-02 00:05:35] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 19 rows 23 cols
[2024-06-02 00:05:35] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 00:05:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 00:05:35] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 00:05:35] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 00:05:35] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 4/8 constraints. Problems are: Problem set: 10 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/23 variables, 1/9 constraints. Problems are: Problem set: 10 solved, 8 unsolved
[2024-06-02 00:05:35] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 1/10 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 19/42 variables, 23/33 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/33 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/33 constraints. Problems are: Problem set: 13 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 33 constraints, problems are : Problem set: 13 solved, 5 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 13 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 15/23 variables, 4/6 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/7 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/10 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 19/42 variables, 23/33 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 5/38 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/38 constraints. Problems are: Problem set: 13 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/38 constraints. Problems are: Problem set: 13 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 38 constraints, problems are : Problem set: 13 solved, 5 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 5/18 constraints, Known Traps: 5/5 constraints]
After SMT, in 459ms problems are : Problem set: 13 solved, 5 unsolved
Search for dead transitions found 13 dead transitions in 459ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 23/49 places, 6/45 transitions.
Graph (complete) has 16 edges and 23 vertex of which 10 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 9 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 6 ms. Remains 9 /23 variables (removed 14) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/49 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 483 ms. Remains : 9/49 places, 6/45 transitions.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 49 cols
[2024-06-02 00:05:35] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 00:05:35] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 00:05:35] [INFO ] Invariant cache hit.
[2024-06-02 00:05:35] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 00:05:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 45/94 variables, 49/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 103 constraints, problems are : Problem set: 0 solved, 44 unsolved in 890 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 45/94 variables, 49/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/94 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 147 constraints, problems are : Problem set: 0 solved, 44 unsolved in 903 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1809ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1810ms
Finished structural reductions in LTL mode , in 1 iterations and 1947 ms. Remains : 49/49 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11 finished in 7481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(p0)) U p1))))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 45
Applied a total of 4 rules in 3 ms. Remains 58 /62 variables (removed 4) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2024-06-02 00:05:37] [INFO ] Computed 14 invariants in 1 ms
[2024-06-02 00:05:37] [INFO ] Implicit Places using invariants in 71 ms returned [5, 12, 18, 25, 31, 32, 33, 34]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 74 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/62 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 50/62 places, 45/45 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 83 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 1 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(p0)) U p1))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 59 transition count 30
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 33 place count 43 transition count 28
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 41 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 40 transition count 27
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 37 place count 40 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 59 place count 27 transition count 18
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 26 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 25 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 62 place count 25 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 64 place count 24 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 76 place count 17 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 77 place count 17 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 78 place count 16 transition count 10
Applied a total of 78 rules in 11 ms. Remains 16 /62 variables (removed 46) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 16 cols
[2024-06-02 00:05:38] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 00:05:38] [INFO ] Implicit Places using invariants in 51 ms returned [2, 5, 10, 12]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/62 places, 10/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 8 transition count 6
Applied a total of 8 rules in 3 ms. Remains 8 /12 variables (removed 4) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-02 00:05:38] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 00:05:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 00:05:38] [INFO ] Invariant cache hit.
[2024-06-02 00:05:38] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/62 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 8/62 places, 6/45 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15
Product exploration explored 100000 steps with 2 reset in 175 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 58 transition count 27
Reduce places removed 21 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 27 rules applied. Total rules applied 46 place count 37 transition count 21
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 31 transition count 21
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 52 place count 31 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 69 place count 21 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 69 place count 21 transition count 13
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 71 place count 20 transition count 13
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 82 place count 14 transition count 8
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 84 place count 13 transition count 7
Applied a total of 84 rules in 8 ms. Remains 13 /62 variables (removed 49) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 13 cols
[2024-06-02 00:05:38] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 00:05:38] [INFO ] Implicit Places using invariants in 35 ms returned [1, 2, 5, 8, 9]
[2024-06-02 00:05:38] [INFO ] Actually due to overlaps returned [8, 1, 2, 9]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/62 places, 7/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 3 place count 9 transition count 4
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 6 transition count 4
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 9 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 2 transition count 2
Applied a total of 12 rules in 3 ms. Remains 2 /9 variables (removed 7) and now considering 2/7 (removed 5) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-02 00:05:38] [INFO ] Computed 1 invariants in 0 ms
[2024-06-02 00:05:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-02 00:05:38] [INFO ] Invariant cache hit.
[2024-06-02 00:05:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2/62 places, 2/45 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 88 ms. Remains : 2/62 places, 2/45 transitions.
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 46 ms.
Product exploration explored 100000 steps with 25000 reset in 56 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-02 00:05:39] [INFO ] Invariant cache hit.
[2024-06-02 00:05:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-02 00:05:39] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-02 00:05:39] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-02 00:05:39] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-06-02 00:05:39] [INFO ] Invariant cache hit.
[2024-06-02 00:05:39] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-02 00:05:39] [INFO ] Invariant cache hit.
[2024-06-02 00:05:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-06-02 00:05:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 2/2 places, 2/2 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-02 00:05:40] [INFO ] Invariant cache hit.
[2024-06-02 00:05:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-02 00:05:40] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-02 00:05:40] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-02 00:05:40] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 43 ms.
Product exploration explored 100000 steps with 25000 reset in 51 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-06-02 00:05:41] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-02 00:05:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 2/2 places, 2/2 transitions.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-06-02 00:05:41] [INFO ] Invariant cache hit.
[2024-06-02 00:05:41] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-02 00:05:41] [INFO ] Invariant cache hit.
[2024-06-02 00:05:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-06-02 00:05:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11 finished in 2670 ms.
[2024-06-02 00:05:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 00:05:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 00:05:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 45 transitions and 126 arcs took 7 ms.
Total runtime 17389 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717286741643

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11
ltl formula formula --ltl=/tmp/1243/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 62 places, 45 transitions and 126 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1243/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1243/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1243/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1243/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 64 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 63, there are 50 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25
pnml2lts-mc( 0/ 4): unique states count: 25
pnml2lts-mc( 0/ 4): unique transitions count: 24
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 79
pnml2lts-mc( 0/ 4): - cum. max stack depth: 79
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 79 states 81 transitions, fanout: 1.025
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 44.5 B/state, compr.: 17.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="IOTPpurchase-PT-C01M01P01D01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is IOTPpurchase-PT-C01M01P01D01, 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 r500-smll-171649588000363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 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 ;